%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM460+2 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n112.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:25 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of formulae : 46 ( 10 unt; 0 def)
% Number of atoms : 161 ( 21 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 199 ( 84 ~; 64 |; 46 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 25 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> equal(sdtpldt0(X1,X2),sdtpldt0(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp6iwxRo/sel_theBenchmark.p_1',mAddComm) ).
fof(8,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> equal(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(X1,sdtpldt0(X2,X3))) ),
file('/export/starexec/sandbox2/tmp/tmp6iwxRo/sel_theBenchmark.p_1',mAddAsso) ).
fof(11,conjecture,
( ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,X1),xn) )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xn,X1),xl) )
& sdtlseqdt0(xn,xl) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,X1),xl) )
| sdtlseqdt0(xm,xl) ) ),
file('/export/starexec/sandbox2/tmp/tmp6iwxRo/sel_theBenchmark.p_1',m__) ).
fof(12,axiom,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/tmp/tmp6iwxRo/sel_theBenchmark.p_1',m__773) ).
fof(19,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp6iwxRo/sel_theBenchmark.p_1',mSortsB) ).
fof(24,negated_conjecture,
~ ( ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,X1),xn) )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xn,X1),xl) )
& sdtlseqdt0(xn,xl) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,X1),xl) )
| sdtlseqdt0(xm,xl) ) ),
inference(assume_negation,[status(cth)],[11]) ).
fof(30,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(sdtpldt0(X1,X2),sdtpldt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(31,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| equal(sdtpldt0(X3,X4),sdtpldt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[30]) ).
cnf(32,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[31]) ).
fof(58,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| equal(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(X1,sdtpldt0(X2,X3))) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(59,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| equal(sdtpldt0(sdtpldt0(X4,X5),X6),sdtpldt0(X4,sdtpldt0(X5,X6))) ),
inference(variable_rename,[status(thm)],[58]) ).
cnf(60,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[59]) ).
fof(66,negated_conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xm,X1),xn) )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xn,X1),xl) )
& sdtlseqdt0(xn,xl)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtpldt0(xm,X1),xl) )
& ~ sdtlseqdt0(xm,xl) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(67,negated_conjecture,
( ? [X2] :
( aNaturalNumber0(X2)
& equal(sdtpldt0(xm,X2),xn) )
& sdtlseqdt0(xm,xn)
& ? [X3] :
( aNaturalNumber0(X3)
& equal(sdtpldt0(xn,X3),xl) )
& sdtlseqdt0(xn,xl)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(sdtpldt0(xm,X4),xl) )
& ~ sdtlseqdt0(xm,xl) ),
inference(variable_rename,[status(thm)],[66]) ).
fof(68,negated_conjecture,
( aNaturalNumber0(esk2_0)
& equal(sdtpldt0(xm,esk2_0),xn)
& sdtlseqdt0(xm,xn)
& aNaturalNumber0(esk3_0)
& equal(sdtpldt0(xn,esk3_0),xl)
& sdtlseqdt0(xn,xl)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(sdtpldt0(xm,X4),xl) )
& ~ sdtlseqdt0(xm,xl) ),
inference(skolemize,[status(esa)],[67]) ).
fof(69,negated_conjecture,
! [X4] :
( ( ~ aNaturalNumber0(X4)
| ~ equal(sdtpldt0(xm,X4),xl) )
& ~ sdtlseqdt0(xm,xl)
& aNaturalNumber0(esk2_0)
& equal(sdtpldt0(xm,esk2_0),xn)
& sdtlseqdt0(xm,xn)
& aNaturalNumber0(esk3_0)
& equal(sdtpldt0(xn,esk3_0),xl)
& sdtlseqdt0(xn,xl) ),
inference(shift_quantors,[status(thm)],[68]) ).
cnf(71,negated_conjecture,
sdtpldt0(xn,esk3_0) = xl,
inference(split_conjunct,[status(thm)],[69]) ).
cnf(72,negated_conjecture,
aNaturalNumber0(esk3_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(74,negated_conjecture,
sdtpldt0(xm,esk2_0) = xn,
inference(split_conjunct,[status(thm)],[69]) ).
cnf(75,negated_conjecture,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(77,negated_conjecture,
( sdtpldt0(xm,X1) != xl
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(79,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(80,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[12]) ).
fof(103,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(104,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[103]) ).
cnf(105,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[104]) ).
cnf(165,negated_conjecture,
( sdtpldt0(X1,xm) != xl
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[77,32,theory(equality)]) ).
cnf(177,negated_conjecture,
( sdtpldt0(X1,xm) != xl
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[165,80,theory(equality)]) ).
cnf(178,negated_conjecture,
( sdtpldt0(X1,xm) != xl
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[177,theory(equality)]) ).
cnf(574,negated_conjecture,
( sdtpldt0(X1,sdtpldt0(X2,xm)) != xl
| ~ aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[178,60,theory(equality)]) ).
cnf(582,negated_conjecture,
( sdtpldt0(X1,sdtpldt0(X2,xm)) != xl
| ~ aNaturalNumber0(sdtpldt0(X1,X2))
| $false
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[574,80,theory(equality)]) ).
cnf(583,negated_conjecture,
( sdtpldt0(X1,sdtpldt0(X2,xm)) != xl
| ~ aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[582,theory(equality)]) ).
cnf(713,negated_conjecture,
( sdtpldt0(X1,sdtpldt0(X2,xm)) != xl
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[583,105]) ).
cnf(716,negated_conjecture,
( sdtpldt0(X1,sdtpldt0(xm,X2)) != xl
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[713,32,theory(equality)]) ).
cnf(727,negated_conjecture,
( sdtpldt0(X1,sdtpldt0(xm,X2)) != xl
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[716,80,theory(equality)]) ).
cnf(728,negated_conjecture,
( sdtpldt0(X1,sdtpldt0(xm,X2)) != xl
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[727,theory(equality)]) ).
cnf(735,negated_conjecture,
( sdtpldt0(X1,xn) != xl
| ~ aNaturalNumber0(esk2_0)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[728,74,theory(equality)]) ).
cnf(744,negated_conjecture,
( sdtpldt0(X1,xn) != xl
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[735,75,theory(equality)]) ).
cnf(745,negated_conjecture,
( sdtpldt0(X1,xn) != xl
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[744,theory(equality)]) ).
cnf(758,negated_conjecture,
( sdtpldt0(xn,X1) != xl
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[745,32,theory(equality)]) ).
cnf(764,negated_conjecture,
( sdtpldt0(xn,X1) != xl
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[758,79,theory(equality)]) ).
cnf(765,negated_conjecture,
( sdtpldt0(xn,X1) != xl
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[764,theory(equality)]) ).
cnf(774,negated_conjecture,
~ aNaturalNumber0(esk3_0),
inference(spm,[status(thm)],[765,71,theory(equality)]) ).
cnf(779,negated_conjecture,
$false,
inference(rw,[status(thm)],[774,72,theory(equality)]) ).
cnf(780,negated_conjecture,
$false,
inference(cn,[status(thm)],[779,theory(equality)]) ).
cnf(781,negated_conjecture,
$false,
780,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM460+2 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.22 % Computer : n112.star.cs.uiowa.edu
% 0.03/0.22 % Model : x86_64 x86_64
% 0.03/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.22 % Memory : 32218.625MB
% 0.03/0.22 % 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 04:35:15 CST 2018
% 0.03/0.23 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.35 -running prover on /export/starexec/sandbox2/tmp/tmp6iwxRo/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.35 -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/tmp6iwxRo/sel_theBenchmark.p_1']
% 0.06/0.35 -prover status Theorem
% 0.06/0.35 Problem theBenchmark.p solved in phase 0.
% 0.06/0.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.35 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.35 Solved 1 out of 1.
% 0.06/0.35 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.35 # SZS status Theorem
% 0.06/0.35 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------