TSTP Solution File: NUM423+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM423+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n091.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:17 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 13 unt; 0 def)
% Number of atoms : 205 ( 21 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 262 ( 104 ~; 113 |; 39 &)
% ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 37 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/tmp/tmpVO9c3z/sel_theBenchmark.p_1',mIntZero) ).
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/tmpVO9c3z/sel_theBenchmark.p_1',mDivisor) ).
fof(9,axiom,
! [X1] :
( aInteger0(X1)
=> ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpVO9c3z/sel_theBenchmark.p_1',mMulZero) ).
fof(10,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/tmpVO9c3z/sel_theBenchmark.p_1',mEquMod) ).
fof(16,axiom,
! [X1] :
( aInteger0(X1)
=> ( equal(sdtpldt0(X1,smndt0(X1)),sz00)
& equal(sz00,sdtpldt0(smndt0(X1),X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpVO9c3z/sel_theBenchmark.p_1',mAddNeg) ).
fof(20,conjecture,
sdteqdtlpzmzozddtrp0(xa,xa,xq),
file('/export/starexec/sandbox2/tmp/tmpVO9c3z/sel_theBenchmark.p_1',m__) ).
fof(21,axiom,
( aInteger0(xa)
& aInteger0(xq)
& ~ equal(xq,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpVO9c3z/sel_theBenchmark.p_1',m__671) ).
fof(22,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(assume_negation,[status(cth)],[20]) ).
fof(23,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
cnf(40,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[5]) ).
fof(41,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(42,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)],[41]) ).
fof(43,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)],[42]) ).
fof(44,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)],[43]) ).
fof(45,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)],[44]) ).
cnf(50,plain,
( aDivisorOf0(X2,X1)
| X2 = sz00
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sdtasdt0(X2,X3) != X1
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[45]) ).
fof(59,plain,
! [X1] :
( ~ aInteger0(X1)
| ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(60,plain,
! [X2] :
( ~ aInteger0(X2)
| ( equal(sdtasdt0(X2,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X2)) ) ),
inference(variable_rename,[status(thm)],[59]) ).
fof(61,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz00),sz00)
| ~ aInteger0(X2) )
& ( equal(sz00,sdtasdt0(sz00,X2))
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[60]) ).
cnf(63,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(64,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)],[10]) ).
fof(65,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)],[64]) ).
fof(66,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)],[65]) ).
cnf(67,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X3,X2,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2))) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(84,plain,
! [X1] :
( ~ aInteger0(X1)
| ( equal(sdtpldt0(X1,smndt0(X1)),sz00)
& equal(sz00,sdtpldt0(smndt0(X1),X1)) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(85,plain,
! [X2] :
( ~ aInteger0(X2)
| ( equal(sdtpldt0(X2,smndt0(X2)),sz00)
& equal(sz00,sdtpldt0(smndt0(X2),X2)) ) ),
inference(variable_rename,[status(thm)],[84]) ).
fof(86,plain,
! [X2] :
( ( equal(sdtpldt0(X2,smndt0(X2)),sz00)
| ~ aInteger0(X2) )
& ( equal(sz00,sdtpldt0(smndt0(X2),X2))
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[85]) ).
cnf(88,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[86]) ).
cnf(98,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(99,plain,
xq != sz00,
inference(split_conjunct,[status(thm)],[21]) ).
cnf(100,plain,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(101,plain,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(202,plain,
( sz00 = X1
| aDivisorOf0(X1,X2)
| sz00 != X2
| ~ aInteger0(sz00)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(spm,[status(thm)],[50,63,theory(equality)]) ).
cnf(210,plain,
( sz00 = X1
| aDivisorOf0(X1,X2)
| sz00 != X2
| $false
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(rw,[status(thm)],[202,40,theory(equality)]) ).
cnf(211,plain,
( sz00 = X1
| aDivisorOf0(X1,X2)
| sz00 != X2
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(cn,[status(thm)],[210,theory(equality)]) ).
cnf(239,plain,
( sz00 = X1
| sdteqdtlpzmzozddtrp0(X2,X2,X1)
| ~ aDivisorOf0(X1,sz00)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[67,88,theory(equality)]) ).
cnf(502,negated_conjecture,
( sz00 = xq
| ~ aDivisorOf0(xq,sz00)
| ~ aInteger0(xa)
| ~ aInteger0(xq) ),
inference(spm,[status(thm)],[98,239,theory(equality)]) ).
cnf(504,negated_conjecture,
( sz00 = xq
| ~ aDivisorOf0(xq,sz00)
| $false
| ~ aInteger0(xq) ),
inference(rw,[status(thm)],[502,101,theory(equality)]) ).
cnf(505,negated_conjecture,
( sz00 = xq
| ~ aDivisorOf0(xq,sz00)
| $false
| $false ),
inference(rw,[status(thm)],[504,100,theory(equality)]) ).
cnf(506,negated_conjecture,
( sz00 = xq
| ~ aDivisorOf0(xq,sz00) ),
inference(cn,[status(thm)],[505,theory(equality)]) ).
cnf(507,negated_conjecture,
~ aDivisorOf0(xq,sz00),
inference(sr,[status(thm)],[506,99,theory(equality)]) ).
cnf(508,negated_conjecture,
( sz00 = xq
| ~ aInteger0(xq)
| ~ aInteger0(sz00) ),
inference(spm,[status(thm)],[507,211,theory(equality)]) ).
cnf(509,negated_conjecture,
( sz00 = xq
| $false
| ~ aInteger0(sz00) ),
inference(rw,[status(thm)],[508,100,theory(equality)]) ).
cnf(510,negated_conjecture,
( sz00 = xq
| $false
| $false ),
inference(rw,[status(thm)],[509,40,theory(equality)]) ).
cnf(511,negated_conjecture,
sz00 = xq,
inference(cn,[status(thm)],[510,theory(equality)]) ).
cnf(512,negated_conjecture,
$false,
inference(sr,[status(thm)],[511,99,theory(equality)]) ).
cnf(513,negated_conjecture,
$false,
512,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM423+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 : n091.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:05:16 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.06/0.36 -running prover on /export/starexec/sandbox2/tmp/tmpVO9c3z/sel_theBenchmark.p_1 with time limit 29
% 0.06/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/tmpVO9c3z/sel_theBenchmark.p_1']
% 0.06/0.36 -prover status Theorem
% 0.06/0.36 Problem theBenchmark.p solved in phase 0.
% 0.06/0.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.36 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.36 Solved 1 out of 1.
% 0.06/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.36 # SZS status Theorem
% 0.06/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------