TSTP Solution File: NUM436+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM436+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n110.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:20 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 8
% Syntax : Number of formulae : 65 ( 14 unt; 0 def)
% Number of atoms : 269 ( 22 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 360 ( 156 ~; 141 |; 58 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 40 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1',mIntPlus) ).
fof(6,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1',mDivisor) ).
fof(11,axiom,
( equal(sdtasdt0(xp,sdtasdt0(xq,xm)),sdtpldt0(xa,smndt0(xb)))
& equal(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xq,sdtasdt0(xp,xm))) ),
file('/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1',m__1071) ).
fof(13,axiom,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& ~ equal(xp,sz00)
& aInteger0(xq)
& ~ equal(xq,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1',m__979) ).
fof(15,conjecture,
( ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xp,X1),sdtpldt0(xa,smndt0(xb))) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
file('/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1',m__) ).
fof(18,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1',mIntMult) ).
fof(20,axiom,
( aInteger0(xm)
& equal(sdtasdt0(sdtasdt0(xp,xq),xm),sdtpldt0(xa,smndt0(xb))) ),
file('/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1',m__1032) ).
fof(21,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1',mIntNeg) ).
fof(28,negated_conjecture,
~ ( ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xp,X1),sdtpldt0(xa,smndt0(xb))) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
inference(assume_negation,[status(cth)],[15]) ).
fof(47,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aInteger0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(48,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[47]) ).
cnf(49,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(50,plain,
! [X1] :
( ~ aInteger0(X1)
| ! [X2] :
( ( ~ aDivisorOf0(X2,X1)
| ( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) ) ) )
& ( ~ aInteger0(X2)
| equal(X2,sz00)
| ! [X3] :
( ~ aInteger0(X3)
| ~ equal(sdtasdt0(X2,X3),X1) )
| aDivisorOf0(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(51,plain,
! [X4] :
( ~ aInteger0(X4)
| ! [X5] :
( ( ~ aDivisorOf0(X5,X4)
| ( aInteger0(X5)
& ~ equal(X5,sz00)
& ? [X6] :
( aInteger0(X6)
& equal(sdtasdt0(X5,X6),X4) ) ) )
& ( ~ aInteger0(X5)
| equal(X5,sz00)
| ! [X7] :
( ~ aInteger0(X7)
| ~ equal(sdtasdt0(X5,X7),X4) )
| aDivisorOf0(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,plain,
! [X4] :
( ~ aInteger0(X4)
| ! [X5] :
( ( ~ aDivisorOf0(X5,X4)
| ( aInteger0(X5)
& ~ equal(X5,sz00)
& aInteger0(esk1_2(X4,X5))
& equal(sdtasdt0(X5,esk1_2(X4,X5)),X4) ) )
& ( ~ aInteger0(X5)
| equal(X5,sz00)
| ! [X7] :
( ~ aInteger0(X7)
| ~ equal(sdtasdt0(X5,X7),X4) )
| aDivisorOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[51]) ).
fof(53,plain,
! [X4,X5,X7] :
( ( ( ~ aInteger0(X7)
| ~ equal(sdtasdt0(X5,X7),X4)
| ~ aInteger0(X5)
| equal(X5,sz00)
| aDivisorOf0(X5,X4) )
& ( ~ aDivisorOf0(X5,X4)
| ( aInteger0(X5)
& ~ equal(X5,sz00)
& aInteger0(esk1_2(X4,X5))
& equal(sdtasdt0(X5,esk1_2(X4,X5)),X4) ) ) )
| ~ aInteger0(X4) ),
inference(shift_quantors,[status(thm)],[52]) ).
fof(54,plain,
! [X4,X5,X7] :
( ( ~ aInteger0(X7)
| ~ equal(sdtasdt0(X5,X7),X4)
| ~ aInteger0(X5)
| equal(X5,sz00)
| aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( aInteger0(X5)
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( ~ equal(X5,sz00)
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( aInteger0(esk1_2(X4,X5))
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( equal(sdtasdt0(X5,esk1_2(X4,X5)),X4)
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) ) ),
inference(distribute,[status(thm)],[53]) ).
cnf(59,plain,
( aDivisorOf0(X2,X1)
| X2 = sz00
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sdtasdt0(X2,X3) != X1
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(76,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(77,plain,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(79,plain,
xq != sz00,
inference(split_conjunct,[status(thm)],[13]) ).
cnf(80,plain,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(82,plain,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(83,plain,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(84,plain,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[13]) ).
fof(90,negated_conjecture,
( ( ! [X1] :
( ~ aInteger0(X1)
| ~ equal(sdtasdt0(xp,X1),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| ( ! [X1] :
( ~ aInteger0(X1)
| ~ equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(91,negated_conjecture,
( ( ! [X2] :
( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xp,X2),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| ( ! [X3] :
( ~ aInteger0(X3)
| ~ equal(sdtasdt0(xq,X3),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
inference(variable_rename,[status(thm)],[90]) ).
fof(92,negated_conjecture,
! [X2,X3] :
( ( ( ~ aInteger0(X3)
| ~ equal(sdtasdt0(xq,X3),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
| ( ( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xp,X2),sdtpldt0(xa,smndt0(xb))) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ) ),
inference(shift_quantors,[status(thm)],[91]) ).
fof(93,negated_conjecture,
! [X2,X3] :
( ( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xp,X2),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(X3)
| ~ equal(sdtasdt0(xq,X3),sdtpldt0(xa,smndt0(xb))) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(X3)
| ~ equal(sdtasdt0(xq,X3),sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aInteger0(X3)
| ~ equal(sdtasdt0(xq,X3),sdtpldt0(xa,smndt0(xb))) )
& ( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xp,X2),sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xp,X2),sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
inference(distribute,[status(thm)],[92]) ).
cnf(99,negated_conjecture,
( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdtasdt0(xp,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[93]) ).
fof(109,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(110,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[109]) ).
cnf(111,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(116,plain,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[20]) ).
fof(117,plain,
! [X1] :
( ~ aInteger0(X1)
| aInteger0(smndt0(X1)) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(118,plain,
! [X2] :
( ~ aInteger0(X2)
| aInteger0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[117]) ).
cnf(119,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[118]) ).
cnf(163,plain,
( aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(smndt0(xb))
| ~ aInteger0(xa) ),
inference(spm,[status(thm)],[49,77,theory(equality)]) ).
cnf(165,plain,
( aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(smndt0(xb))
| $false ),
inference(rw,[status(thm)],[163,84,theory(equality)]) ).
cnf(166,plain,
( aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(smndt0(xb)) ),
inference(cn,[status(thm)],[165,theory(equality)]) ).
cnf(167,plain,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[76,77,theory(equality)]) ).
cnf(281,plain,
( sz00 = xq
| aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(sdtasdt0(xp,xm))
| ~ aInteger0(xq)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[59,167,theory(equality)]) ).
cnf(291,plain,
( sz00 = xq
| aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(sdtasdt0(xp,xm))
| $false
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[281,80,theory(equality)]) ).
cnf(292,plain,
( sz00 = xq
| aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(sdtasdt0(xp,xm))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[291,theory(equality)]) ).
cnf(293,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(sdtasdt0(xp,xm))
| ~ aInteger0(X1) ),
inference(sr,[status(thm)],[292,79,theory(equality)]) ).
cnf(378,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
inference(rw,[status(thm)],[99,77,theory(equality)]) ).
cnf(379,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1)
| ~ aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm))) ),
inference(rw,[status(thm)],[378,77,theory(equality)]) ).
cnf(558,plain,
( aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(xb) ),
inference(spm,[status(thm)],[166,119,theory(equality)]) ).
cnf(559,plain,
( aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm)))
| $false ),
inference(rw,[status(thm)],[558,83,theory(equality)]) ).
cnf(560,plain,
aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm))),
inference(cn,[status(thm)],[559,theory(equality)]) ).
cnf(621,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(X1)
| ~ aInteger0(xm)
| ~ aInteger0(xp) ),
inference(spm,[status(thm)],[293,111,theory(equality)]) ).
cnf(622,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(X1)
| $false
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[621,116,theory(equality)]) ).
cnf(623,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(X1)
| $false
| $false ),
inference(rw,[status(thm)],[622,82,theory(equality)]) ).
cnf(624,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[623,theory(equality)]) ).
cnf(631,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm))) ),
inference(er,[status(thm)],[624,theory(equality)]) ).
cnf(632,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| $false ),
inference(rw,[status(thm)],[631,560,theory(equality)]) ).
cnf(633,plain,
aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm))),
inference(cn,[status(thm)],[632,theory(equality)]) ).
cnf(637,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xp,X1)
| $false
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[379,633,theory(equality)]) ).
cnf(638,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[637,theory(equality)]) ).
cnf(657,negated_conjecture,
~ aInteger0(sdtasdt0(xq,xm)),
inference(er,[status(thm)],[638,theory(equality)]) ).
cnf(667,negated_conjecture,
( ~ aInteger0(xm)
| ~ aInteger0(xq) ),
inference(spm,[status(thm)],[657,111,theory(equality)]) ).
cnf(668,negated_conjecture,
( $false
| ~ aInteger0(xq) ),
inference(rw,[status(thm)],[667,116,theory(equality)]) ).
cnf(669,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[668,80,theory(equality)]) ).
cnf(670,negated_conjecture,
$false,
inference(cn,[status(thm)],[669,theory(equality)]) ).
cnf(671,negated_conjecture,
$false,
670,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM436+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n110.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 05:19:00 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.07/0.36 -running prover on /export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.36 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpfFZCSm/sel_theBenchmark.p_1']
% 0.07/0.36 -prover status Theorem
% 0.07/0.36 Problem theBenchmark.p solved in phase 0.
% 0.07/0.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 Solved 1 out of 1.
% 0.07/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.36 # SZS status Theorem
% 0.07/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------