%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM474+2 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n035.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:28 EST 2018
% Result : Theorem 0.41s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 73 ( 12 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 28 |; 14 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,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/tmpTFoDbe/sel_theBenchmark.p_1',mAMDistr) ).
fof(12,axiom,
( aNaturalNumber0(xr)
& equal(sdtpldt0(xp,xr),xq)
& equal(xr,sdtmndt0(xq,xp)) ),
file('/export/starexec/sandbox2/tmp/tmpTFoDbe/sel_theBenchmark.p_1',m__1422) ).
fof(21,axiom,
( aNaturalNumber0(xp)
& equal(xm,sdtasdt0(xl,xp))
& equal(xp,sdtsldt0(xm,xl)) ),
file('/export/starexec/sandbox2/tmp/tmpTFoDbe/sel_theBenchmark.p_1',m__1360) ).
fof(25,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/tmp/tmpTFoDbe/sel_theBenchmark.p_1',m__1324) ).
fof(28,axiom,
( aNaturalNumber0(xq)
& equal(sdtpldt0(xm,xn),sdtasdt0(xl,xq))
& equal(xq,sdtsldt0(sdtpldt0(xm,xn),xl)) ),
file('/export/starexec/sandbox2/tmp/tmpTFoDbe/sel_theBenchmark.p_1',m__1379) ).
fof(29,conjecture,
equal(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)),sdtpldt0(sdtasdt0(xl,xp),xn)),
file('/export/starexec/sandbox2/tmp/tmpTFoDbe/sel_theBenchmark.p_1',m__) ).
fof(42,negated_conjecture,
~ equal(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)),sdtpldt0(sdtasdt0(xl,xp),xn)),
inference(assume_negation,[status(cth)],[29]) ).
fof(43,negated_conjecture,
~ equal(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)),sdtpldt0(sdtasdt0(xl,xp),xn)),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
fof(64,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)],[6]) ).
fof(65,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)],[64]) ).
fof(66,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)],[65]) ).
cnf(68,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(90,plain,
sdtpldt0(xp,xr) = xq,
inference(split_conjunct,[status(thm)],[12]) ).
cnf(91,plain,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(133,plain,
xm = sdtasdt0(xl,xp),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(134,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(157,plain,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(164,plain,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(166,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(271,negated_conjecture,
sdtpldt0(xm,sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
inference(rw,[status(thm)],[166,133,theory(equality)]) ).
cnf(272,negated_conjecture,
sdtpldt0(xm,sdtasdt0(xl,xr)) != sdtasdt0(xl,xq),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[271,133,theory(equality)]),164,theory(equality)]) ).
cnf(771,plain,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(xp,X1))
| ~ aNaturalNumber0(xl)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[68,133,theory(equality)]) ).
cnf(804,plain,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(xp,X1))
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[771,157,theory(equality)]) ).
cnf(805,plain,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(xp,X1))
| $false
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[804,134,theory(equality)]) ).
cnf(806,plain,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(xp,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[805,theory(equality)]) ).
cnf(28791,plain,
( sdtasdt0(xl,sdtpldt0(xp,xr)) != sdtasdt0(xl,xq)
| ~ aNaturalNumber0(xr) ),
inference(spm,[status(thm)],[272,806,theory(equality)]) ).
cnf(28861,plain,
( $false
| ~ aNaturalNumber0(xr) ),
inference(rw,[status(thm)],[28791,90,theory(equality)]) ).
cnf(28862,plain,
( $false
| $false ),
inference(rw,[status(thm)],[28861,91,theory(equality)]) ).
cnf(28863,plain,
$false,
inference(cn,[status(thm)],[28862,theory(equality)]) ).
cnf(28864,plain,
$false,
28863,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM474+2 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.05 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.25 % Computer : n035.star.cs.uiowa.edu
% 0.02/0.25 % Model : x86_64 x86_64
% 0.02/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.25 % Memory : 32218.625MB
% 0.02/0.25 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.25 % CPULimit : 300
% 0.02/0.25 % DateTime : Fri Jan 5 05:02:15 CST 2018
% 0.02/0.25 % CPUTime :
% 0.06/0.29 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.29 --creating new selector for []
% 0.41/0.82 -running prover on /export/starexec/sandbox2/tmp/tmpTFoDbe/sel_theBenchmark.p_1 with time limit 29
% 0.41/0.82 -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/tmpTFoDbe/sel_theBenchmark.p_1']
% 0.41/0.82 -prover status Theorem
% 0.41/0.82 Problem theBenchmark.p solved in phase 0.
% 0.41/0.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.82 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.82 Solved 1 out of 1.
% 0.41/0.82 # Problem is unsatisfiable (or provable), constructing proof object
% 0.41/0.82 # SZS status Theorem
% 0.41/0.82 # SZS output start CNFRefutation.
% See solution above
% 0.41/0.82 # SZS output end CNFRefutation
%------------------------------------------------------------------------------