TSTP Solution File: NUM432+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM432+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n135.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:19 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 15 unt; 0 def)
% Number of atoms : 212 ( 14 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 268 ( 107 ~; 118 |; 37 &)
% ( 2 <=>; 4 =>; 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 : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 41 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpUOmQ9B/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/tmpUOmQ9B/sel_theBenchmark.p_1',mDivisor) ).
fof(9,axiom,
( aInteger0(xm)
& equal(sdtasdt0(xq,xm),sdtpldt0(xb,smndt0(xc))) ),
file('/export/starexec/sandbox2/tmp/tmpUOmQ9B/sel_theBenchmark.p_1',m__899) ).
fof(10,axiom,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& ~ equal(xq,sz00)
& aInteger0(xc) ),
file('/export/starexec/sandbox2/tmp/tmpUOmQ9B/sel_theBenchmark.p_1',m__818) ).
fof(11,axiom,
( aInteger0(xn)
& equal(sdtasdt0(xq,xn),sdtpldt0(xa,smndt0(xb))) ),
file('/export/starexec/sandbox2/tmp/tmpUOmQ9B/sel_theBenchmark.p_1',m__876) ).
fof(13,axiom,
equal(sdtasdt0(xq,sdtpldt0(xn,xm)),sdtpldt0(xa,smndt0(xc))),
file('/export/starexec/sandbox2/tmp/tmpUOmQ9B/sel_theBenchmark.p_1',m__924) ).
fof(15,conjecture,
sdteqdtlpzmzozddtrp0(xa,xc,xq),
file('/export/starexec/sandbox2/tmp/tmpUOmQ9B/sel_theBenchmark.p_1',m__) ).
fof(19,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpUOmQ9B/sel_theBenchmark.p_1',mIntMult) ).
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/sandbox2/tmp/tmpUOmQ9B/sel_theBenchmark.p_1',mEquMod) ).
fof(28,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(assume_negation,[status(cth)],[15]) ).
fof(29,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
fof(48,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aInteger0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(49,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[48]) ).
cnf(50,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(51,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(52,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)],[51]) ).
fof(53,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)],[52]) ).
fof(54,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)],[53]) ).
fof(55,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)],[54]) ).
cnf(60,plain,
( aDivisorOf0(X2,X1)
| X2 = sz00
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sdtasdt0(X2,X3) != X1
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(68,plain,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(69,plain,
aInteger0(xc),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(70,plain,
xq != sz00,
inference(split_conjunct,[status(thm)],[10]) ).
cnf(71,plain,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(73,plain,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(75,plain,
aInteger0(xn),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(77,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(83,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(split_conjunct,[status(thm)],[29]) ).
fof(92,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[19]) ).
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]) ).
fof(110,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(111,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)],[110]) ).
fof(112,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)],[111]) ).
cnf(113,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X3,X2,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2))) ),
inference(split_conjunct,[status(thm)],[112]) ).
cnf(240,plain,
( sz00 = X1
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(sdtasdt0(X1,X2)) ),
inference(er,[status(thm)],[60,theory(equality)]) ).
cnf(316,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(xa,xc,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))
| ~ aInteger0(xa)
| ~ aInteger0(xc)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[113,77,theory(equality)]) ).
cnf(329,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(xa,xc,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))
| $false
| ~ aInteger0(xc)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[316,73,theory(equality)]) ).
cnf(330,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(xa,xc,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))
| $false
| $false
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[329,69,theory(equality)]) ).
cnf(331,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(xa,xc,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[330,theory(equality)]) ).
cnf(2186,plain,
( sz00 = X1
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[240,94]) ).
cnf(9480,plain,
( sz00 = xq
| sdteqdtlpzmzozddtrp0(xa,xc,xq)
| ~ aInteger0(xq)
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(spm,[status(thm)],[331,2186,theory(equality)]) ).
cnf(9492,plain,
( sz00 = xq
| sdteqdtlpzmzozddtrp0(xa,xc,xq)
| $false
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(rw,[status(thm)],[9480,71,theory(equality)]) ).
cnf(9493,plain,
( sz00 = xq
| sdteqdtlpzmzozddtrp0(xa,xc,xq)
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[9492,theory(equality)]) ).
cnf(9494,plain,
( sdteqdtlpzmzozddtrp0(xa,xc,xq)
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(sr,[status(thm)],[9493,70,theory(equality)]) ).
cnf(9495,plain,
~ aInteger0(sdtpldt0(xn,xm)),
inference(sr,[status(thm)],[9494,83,theory(equality)]) ).
cnf(9496,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xn) ),
inference(spm,[status(thm)],[9495,50,theory(equality)]) ).
cnf(9499,plain,
( $false
| ~ aInteger0(xn) ),
inference(rw,[status(thm)],[9496,68,theory(equality)]) ).
cnf(9500,plain,
( $false
| $false ),
inference(rw,[status(thm)],[9499,75,theory(equality)]) ).
cnf(9501,plain,
$false,
inference(cn,[status(thm)],[9500,theory(equality)]) ).
cnf(9502,plain,
$false,
9501,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM432+1 : 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 : n135.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 03:46:45 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.06/0.45 -running prover on /export/starexec/sandbox2/tmp/tmpUOmQ9B/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.45 -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/tmpUOmQ9B/sel_theBenchmark.p_1']
% 0.06/0.45 -prover status Theorem
% 0.06/0.45 Problem theBenchmark.p solved in phase 0.
% 0.06/0.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.45 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.45 Solved 1 out of 1.
% 0.06/0.45 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.45 # SZS status Theorem
% 0.06/0.45 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.45 # SZS output end CNFRefutation
%------------------------------------------------------------------------------