%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM436+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n061.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.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 7
% Syntax : Number of formulae : 71 ( 16 unt; 0 def)
% Number of atoms : 278 ( 31 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 347 ( 140 ~; 163 |; 39 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 62 ( 0 sgn 35 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp524J_k/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/sandbox/tmp/tmp524J_k/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/sandbox/tmp/tmp524J_k/sel_theBenchmark.p_1',m__979) ).
fof(15,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xb,xp)
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
file('/export/starexec/sandbox/tmp/tmp524J_k/sel_theBenchmark.p_1',m__) ).
fof(18,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp524J_k/sel_theBenchmark.p_1',mIntMult) ).
fof(20,axiom,
( aInteger0(xm)
& equal(sdtasdt0(sdtasdt0(xp,xq),xm),sdtpldt0(xa,smndt0(xb))) ),
file('/export/starexec/sandbox/tmp/tmp524J_k/sel_theBenchmark.p_1',m__1032) ).
fof(25,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& ~ equal(X3,sz00) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
file('/export/starexec/sandbox/tmp/tmp524J_k/sel_theBenchmark.p_1',mEquMod) ).
fof(28,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(assume_negation,[status(cth)],[15]) ).
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(70,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(71,plain,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(73,plain,
xq != sz00,
inference(split_conjunct,[status(thm)],[13]) ).
cnf(74,plain,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(75,plain,
xp != sz00,
inference(split_conjunct,[status(thm)],[13]) ).
cnf(76,plain,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(77,plain,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(78,plain,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[13]) ).
fof(84,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(fof_nnf,[status(thm)],[28]) ).
cnf(85,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(split_conjunct,[status(thm)],[84]) ).
fof(92,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(93,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[92]) ).
cnf(94,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[93]) ).
cnf(99,plain,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[20]) ).
fof(112,plain,
! [X1,X2,X3] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| equal(X3,sz00)
| ( ( ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) )
& ( ~ aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2)))
| sdteqdtlpzmzozddtrp0(X1,X2,X3) ) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(113,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(X6,sz00)
| ( ( ~ sdteqdtlpzmzozddtrp0(X4,X5,X6)
| aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))) )
& ( ~ aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5)))
| sdteqdtlpzmzozddtrp0(X4,X5,X6) ) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,plain,
! [X4,X5,X6] :
( ( ~ sdteqdtlpzmzozddtrp0(X4,X5,X6)
| aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5)))
| ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(X6,sz00) )
& ( ~ aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5)))
| sdteqdtlpzmzozddtrp0(X4,X5,X6)
| ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(X6,sz00) ) ),
inference(distribute,[status(thm)],[113]) ).
cnf(115,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X3,X2,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2))) ),
inference(split_conjunct,[status(thm)],[114]) ).
cnf(132,plain,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[70,71,theory(equality)]) ).
cnf(244,plain,
( sz00 = X1
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(sdtasdt0(X1,X2)) ),
inference(er,[status(thm)],[59,theory(equality)]) ).
cnf(245,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,132,theory(equality)]) ).
cnf(254,plain,
( sz00 = xq
| aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(sdtasdt0(xp,xm))
| $false
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[245,74,theory(equality)]) ).
cnf(255,plain,
( sz00 = xq
| aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(sdtasdt0(xp,xm))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[254,theory(equality)]) ).
cnf(256,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(sdtasdt0(xp,xm))
| ~ aInteger0(X1) ),
inference(sr,[status(thm)],[255,73,theory(equality)]) ).
cnf(330,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(xa,xb,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(xa)
| ~ aInteger0(xb)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[115,71,theory(equality)]) ).
cnf(337,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(xa,xb,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))
| $false
| ~ aInteger0(xb)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[330,78,theory(equality)]) ).
cnf(338,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(xa,xb,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))
| $false
| $false
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[337,77,theory(equality)]) ).
cnf(339,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(xa,xb,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[338,theory(equality)]) ).
cnf(454,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(X1)
| ~ aInteger0(xm)
| ~ aInteger0(xp) ),
inference(spm,[status(thm)],[256,94,theory(equality)]) ).
cnf(455,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(X1)
| $false
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[454,99,theory(equality)]) ).
cnf(456,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(X1)
| $false
| $false ),
inference(rw,[status(thm)],[455,76,theory(equality)]) ).
cnf(457,plain,
( aDivisorOf0(xq,X1)
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[456,theory(equality)]) ).
cnf(458,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm))) ),
inference(er,[status(thm)],[457,theory(equality)]) ).
cnf(459,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(sdtasdt0(xq,xm))
| ~ aInteger0(xp) ),
inference(spm,[status(thm)],[458,94,theory(equality)]) ).
cnf(460,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(sdtasdt0(xq,xm))
| $false ),
inference(rw,[status(thm)],[459,76,theory(equality)]) ).
cnf(461,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(cn,[status(thm)],[460,theory(equality)]) ).
cnf(462,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(xm)
| ~ aInteger0(xq) ),
inference(spm,[status(thm)],[461,94,theory(equality)]) ).
cnf(463,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| $false
| ~ aInteger0(xq) ),
inference(rw,[status(thm)],[462,99,theory(equality)]) ).
cnf(464,plain,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| $false
| $false ),
inference(rw,[status(thm)],[463,74,theory(equality)]) ).
cnf(465,plain,
aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm))),
inference(cn,[status(thm)],[464,theory(equality)]) ).
cnf(2227,plain,
( sz00 = X1
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[244,94]) ).
cnf(10210,plain,
( sz00 = xq
| sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ aInteger0(xq) ),
inference(spm,[status(thm)],[339,465,theory(equality)]) ).
cnf(10213,plain,
( sz00 = xp
| sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aInteger0(xp)
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(spm,[status(thm)],[339,2227,theory(equality)]) ).
cnf(10214,plain,
( sz00 = xq
| sdteqdtlpzmzozddtrp0(xa,xb,xq)
| $false ),
inference(rw,[status(thm)],[10210,74,theory(equality)]) ).
cnf(10215,plain,
( sz00 = xq
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(cn,[status(thm)],[10214,theory(equality)]) ).
cnf(10216,plain,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(sr,[status(thm)],[10215,73,theory(equality)]) ).
cnf(10222,plain,
( sz00 = xp
| sdteqdtlpzmzozddtrp0(xa,xb,xp)
| $false
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(rw,[status(thm)],[10213,76,theory(equality)]) ).
cnf(10223,plain,
( sz00 = xp
| sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(cn,[status(thm)],[10222,theory(equality)]) ).
cnf(10224,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(sr,[status(thm)],[10223,75,theory(equality)]) ).
cnf(10228,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| $false ),
inference(rw,[status(thm)],[85,10216,theory(equality)]) ).
cnf(10229,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xb,xp),
inference(cn,[status(thm)],[10228,theory(equality)]) ).
cnf(10464,plain,
~ aInteger0(sdtasdt0(xq,xm)),
inference(sr,[status(thm)],[10224,10229,theory(equality)]) ).
cnf(10465,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xq) ),
inference(spm,[status(thm)],[10464,94,theory(equality)]) ).
cnf(10467,plain,
( $false
| ~ aInteger0(xq) ),
inference(rw,[status(thm)],[10465,99,theory(equality)]) ).
cnf(10468,plain,
( $false
| $false ),
inference(rw,[status(thm)],[10467,74,theory(equality)]) ).
cnf(10469,plain,
$false,
inference(cn,[status(thm)],[10468,theory(equality)]) ).
cnf(10470,plain,
$false,
10469,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM436+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n061.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 03:50:30 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.06/0.48 -running prover on /export/starexec/sandbox/tmp/tmp524J_k/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.48 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp524J_k/sel_theBenchmark.p_1']
% 0.06/0.48 -prover status Theorem
% 0.06/0.48 Problem theBenchmark.p solved in phase 0.
% 0.06/0.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.48 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.48 Solved 1 out of 1.
% 0.06/0.48 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.48 # SZS status Theorem
% 0.06/0.48 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.48 # SZS output end CNFRefutation
%------------------------------------------------------------------------------