TSTP Solution File: NUM475+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM475+2 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n068.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.36s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 17 unt; 0 def)
% Number of atoms : 100 ( 17 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 109 ( 47 ~; 45 |; 14 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 27 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,axiom,
( aNaturalNumber0(xr)
& equal(sdtpldt0(xp,xr),xq)
& equal(xr,sdtmndt0(xq,xp)) ),
file('/export/starexec/sandbox2/tmp/tmpyR9vjL/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/tmpyR9vjL/sel_theBenchmark.p_1',m__1360) ).
fof(25,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/tmp/tmpyR9vjL/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/tmpyR9vjL/sel_theBenchmark.p_1',m__1379) ).
fof(29,conjecture,
equal(xn,sdtasdt0(xl,xr)),
file('/export/starexec/sandbox2/tmp/tmpyR9vjL/sel_theBenchmark.p_1',m__) ).
fof(32,axiom,
equal(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)),sdtpldt0(sdtasdt0(xl,xp),xn)),
file('/export/starexec/sandbox2/tmp/tmpyR9vjL/sel_theBenchmark.p_1',m__1459) ).
fof(35,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpyR9vjL/sel_theBenchmark.p_1',mSortsB_02) ).
fof(38,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( equal(sdtpldt0(X1,X2),sdtpldt0(X1,X3))
| equal(sdtpldt0(X2,X1),sdtpldt0(X3,X1)) )
=> equal(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmpyR9vjL/sel_theBenchmark.p_1',mAddCanc) ).
fof(43,negated_conjecture,
~ equal(xn,sdtasdt0(xl,xr)),
inference(assume_negation,[status(cth)],[29]) ).
fof(44,negated_conjecture,
~ equal(xn,sdtasdt0(xl,xr)),
inference(fof_simplification,[status(thm)],[43,theory(equality)]) ).
cnf(92,plain,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(134,plain,
xm = sdtasdt0(xl,xp),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(156,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(157,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(158,plain,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(165,plain,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(167,negated_conjecture,
xn != sdtasdt0(xl,xr),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(176,plain,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
inference(split_conjunct,[status(thm)],[32]) ).
fof(187,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(188,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[187]) ).
cnf(189,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[188]) ).
fof(194,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ( ~ equal(sdtpldt0(X1,X2),sdtpldt0(X1,X3))
& ~ equal(sdtpldt0(X2,X1),sdtpldt0(X3,X1)) )
| equal(X2,X3) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(195,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ( ~ equal(sdtpldt0(X4,X5),sdtpldt0(X4,X6))
& ~ equal(sdtpldt0(X5,X4),sdtpldt0(X6,X4)) )
| equal(X5,X6) ),
inference(variable_rename,[status(thm)],[194]) ).
fof(196,plain,
! [X4,X5,X6] :
( ( ~ equal(sdtpldt0(X4,X5),sdtpldt0(X4,X6))
| equal(X5,X6)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) )
& ( ~ equal(sdtpldt0(X5,X4),sdtpldt0(X6,X4))
| equal(X5,X6)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) ) ),
inference(distribute,[status(thm)],[195]) ).
cnf(198,plain,
( X2 = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtpldt0(X3,X2) != sdtpldt0(X3,X1) ),
inference(split_conjunct,[status(thm)],[196]) ).
cnf(218,plain,
sdtpldt0(xm,sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
inference(rw,[status(thm)],[176,134,theory(equality)]) ).
cnf(219,plain,
sdtpldt0(xm,sdtasdt0(xl,xr)) = sdtasdt0(xl,xq),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[218,134,theory(equality)]),165,theory(equality)]) ).
cnf(596,plain,
( xn = X1
| sdtasdt0(xl,xq) != sdtpldt0(xm,X1)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[198,165,theory(equality)]) ).
cnf(622,plain,
( xn = X1
| sdtasdt0(xl,xq) != sdtpldt0(xm,X1)
| $false
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[596,157,theory(equality)]) ).
cnf(623,plain,
( xn = X1
| sdtasdt0(xl,xq) != sdtpldt0(xm,X1)
| $false
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[622,156,theory(equality)]) ).
cnf(624,plain,
( xn = X1
| sdtasdt0(xl,xq) != sdtpldt0(xm,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[623,theory(equality)]) ).
cnf(17366,plain,
( xn = sdtasdt0(xl,xr)
| ~ aNaturalNumber0(sdtasdt0(xl,xr)) ),
inference(spm,[status(thm)],[624,219,theory(equality)]) ).
cnf(17373,plain,
~ aNaturalNumber0(sdtasdt0(xl,xr)),
inference(sr,[status(thm)],[17366,167,theory(equality)]) ).
cnf(17389,plain,
( ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xl) ),
inference(spm,[status(thm)],[17373,189,theory(equality)]) ).
cnf(17396,plain,
( $false
| ~ aNaturalNumber0(xl) ),
inference(rw,[status(thm)],[17389,92,theory(equality)]) ).
cnf(17397,plain,
( $false
| $false ),
inference(rw,[status(thm)],[17396,158,theory(equality)]) ).
cnf(17398,plain,
$false,
inference(cn,[status(thm)],[17397,theory(equality)]) ).
cnf(17399,plain,
$false,
17398,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM475+2 : 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 : n068.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 05:08:00 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.36/0.61 -running prover on /export/starexec/sandbox2/tmp/tmpyR9vjL/sel_theBenchmark.p_1 with time limit 29
% 0.36/0.61 -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/tmpyR9vjL/sel_theBenchmark.p_1']
% 0.36/0.61 -prover status Theorem
% 0.36/0.61 Problem theBenchmark.p solved in phase 0.
% 0.36/0.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.36/0.61 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.36/0.61 Solved 1 out of 1.
% 0.36/0.61 # Problem is unsatisfiable (or provable), constructing proof object
% 0.36/0.61 # SZS status Theorem
% 0.36/0.61 # SZS output start CNFRefutation.
% See solution above
% 0.43/0.61 # SZS output end CNFRefutation
%------------------------------------------------------------------------------