TSTP Solution File: NUM467+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM467+2 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n156.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:26 EST 2018
% Result : Theorem 106.99s
% Output : CNFRefutation 106.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 110 ( 11 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 118 ( 45 ~; 42 |; 29 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 21 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/tmp/tmpSMD2rE/sel_theBenchmark.p_2',m__1240) ).
fof(7,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( equal(sdtasdt0(X1,sdtpldt0(X2,X3)),sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)))
& equal(sdtasdt0(sdtpldt0(X2,X3),X1),sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))) ) ),
file('/export/starexec/sandbox2/tmp/tmpSMD2rE/sel_theBenchmark.p_2',mAMDistr) ).
fof(12,axiom,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xl,X1)) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xl,X1)) )
& doDivides0(xl,xn) ),
file('/export/starexec/sandbox2/tmp/tmpSMD2rE/sel_theBenchmark.p_2',m__1240_04) ).
fof(23,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,xn),sdtasdt0(xl,X1)) )
| doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox2/tmp/tmpSMD2rE/sel_theBenchmark.p_2',m__) ).
fof(30,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpSMD2rE/sel_theBenchmark.p_2',mSortsB) ).
fof(36,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,xn),sdtasdt0(xl,X1)) )
| doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(assume_negation,[status(cth)],[23]) ).
cnf(44,plain,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[2]) ).
fof(60,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ( equal(sdtasdt0(X1,sdtpldt0(X2,X3)),sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)))
& equal(sdtasdt0(sdtpldt0(X2,X3),X1),sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(61,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ( equal(sdtasdt0(X4,sdtpldt0(X5,X6)),sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6)))
& equal(sdtasdt0(sdtpldt0(X5,X6),X4),sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,plain,
! [X4,X5,X6] :
( ( equal(sdtasdt0(X4,sdtpldt0(X5,X6)),sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6)))
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) )
& ( equal(sdtasdt0(sdtpldt0(X5,X6),X4),sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)))
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) ) ),
inference(distribute,[status(thm)],[61]) ).
cnf(64,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(84,plain,
( ? [X2] :
( aNaturalNumber0(X2)
& equal(xm,sdtasdt0(xl,X2)) )
& doDivides0(xl,xm)
& ? [X3] :
( aNaturalNumber0(X3)
& equal(xn,sdtasdt0(xl,X3)) )
& doDivides0(xl,xn) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(85,plain,
( aNaturalNumber0(esk2_0)
& equal(xm,sdtasdt0(xl,esk2_0))
& doDivides0(xl,xm)
& aNaturalNumber0(esk3_0)
& equal(xn,sdtasdt0(xl,esk3_0))
& doDivides0(xl,xn) ),
inference(skolemize,[status(esa)],[84]) ).
cnf(87,plain,
xn = sdtasdt0(xl,esk3_0),
inference(split_conjunct,[status(thm)],[85]) ).
cnf(88,plain,
aNaturalNumber0(esk3_0),
inference(split_conjunct,[status(thm)],[85]) ).
cnf(90,plain,
xm = sdtasdt0(xl,esk2_0),
inference(split_conjunct,[status(thm)],[85]) ).
cnf(91,plain,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[85]) ).
fof(141,negated_conjecture,
( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtpldt0(xm,xn),sdtasdt0(xl,X1)) )
& ~ doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(142,negated_conjecture,
( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xm,xn),sdtasdt0(xl,X2)) )
& ~ doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(variable_rename,[status(thm)],[141]) ).
fof(143,negated_conjecture,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xm,xn),sdtasdt0(xl,X2)) )
& ~ doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(shift_quantors,[status(thm)],[142]) ).
cnf(145,negated_conjecture,
( sdtpldt0(xm,xn) != sdtasdt0(xl,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[143]) ).
fof(168,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(169,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[168]) ).
cnf(170,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[169]) ).
cnf(589,plain,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(esk2_0,X1))
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(esk2_0)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[64,90,theory(equality)]) ).
cnf(620,plain,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(esk2_0,X1))
| $false
| ~ aNaturalNumber0(esk2_0)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[589,44,theory(equality)]) ).
cnf(621,plain,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(esk2_0,X1))
| $false
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[620,91,theory(equality)]) ).
cnf(622,plain,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(esk2_0,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[621,theory(equality)]) ).
cnf(19026,plain,
( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))
| ~ aNaturalNumber0(esk3_0) ),
inference(spm,[status(thm)],[622,87,theory(equality)]) ).
cnf(19092,plain,
( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))
| $false ),
inference(rw,[status(thm)],[19026,88,theory(equality)]) ).
cnf(19093,plain,
sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0)),
inference(cn,[status(thm)],[19092,theory(equality)]) ).
cnf(3659987,plain,
~ aNaturalNumber0(sdtpldt0(esk2_0,esk3_0)),
inference(spm,[status(thm)],[145,19093,theory(equality)]) ).
cnf(3662991,plain,
( ~ aNaturalNumber0(esk3_0)
| ~ aNaturalNumber0(esk2_0) ),
inference(spm,[status(thm)],[3659987,170,theory(equality)]) ).
cnf(3663015,plain,
( $false
| ~ aNaturalNumber0(esk2_0) ),
inference(rw,[status(thm)],[3662991,88,theory(equality)]) ).
cnf(3663016,plain,
( $false
| $false ),
inference(rw,[status(thm)],[3663015,91,theory(equality)]) ).
cnf(3663017,plain,
$false,
inference(cn,[status(thm)],[3663016,theory(equality)]) ).
cnf(3663018,plain,
$false,
3663017,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM467+2 : TPTP v7.0.0. Released v4.0.0.
% 0.01/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n156.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 04:47:45 CST 2018
% 0.03/0.24 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 29.11/29.38 eprover: CPU time limit exceeded, terminating
% 106.99/110.94 -running prover on /export/starexec/sandbox2/tmp/tmpSMD2rE/sel_theBenchmark.p_1 with time limit 29
% 106.99/110.94 -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/tmpSMD2rE/sel_theBenchmark.p_1']
% 106.99/110.94 -prover status ResourceOut
% 106.99/110.94 -running prover on /export/starexec/sandbox2/tmp/tmpSMD2rE/sel_theBenchmark.p_2 with time limit 80
% 106.99/110.94 -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=80', '/export/starexec/sandbox2/tmp/tmpSMD2rE/sel_theBenchmark.p_2']
% 106.99/110.94 -prover status Theorem
% 106.99/110.94 Problem theBenchmark.p solved in phase 1.
% 106.99/110.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 106.99/110.94 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 106.99/110.94 Solved 1 out of 1.
% 106.99/110.94 # Problem is unsatisfiable (or provable), constructing proof object
% 106.99/110.94 # SZS status Theorem
% 106.99/110.94 # SZS output start CNFRefutation.
% See solution above
% 106.99/110.96 # SZS output end CNFRefutation
%------------------------------------------------------------------------------