TSTP Solution File: NUM576+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM576+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n110.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:51 EST 2018
% Result : Theorem 4.94s
% Output : CNFRefutation 4.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 80 ( 7 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 85 ( 35 ~; 39 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 19 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
( aElementOf0(xi,szNzAzT0)
& aElementOf0(xj,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpJdS7ux/sel_theBenchmark.p_1',m__3856) ).
fof(68,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpJdS7ux/sel_theBenchmark.p_1',mLessTotal) ).
fof(69,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> equal(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpJdS7ux/sel_theBenchmark.p_1',mLessASymm) ).
fof(81,conjecture,
( ~ equal(xi,xj)
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
file('/export/starexec/sandbox2/tmp/tmpJdS7ux/sel_theBenchmark.p_1',m__) ).
fof(86,negated_conjecture,
~ ( ~ equal(xi,xj)
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
inference(assume_negation,[status(cth)],[81]) ).
cnf(95,plain,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[2]) ).
cnf(96,plain,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[2]) ).
fof(4428,plain,
! [X1,X2] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1) ),
inference(fof_nnf,[status(thm)],[68]) ).
fof(4429,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| sdtlseqdt0(X3,X4)
| sdtlseqdt0(szszuzczcdt0(X4),X3) ),
inference(variable_rename,[status(thm)],[4428]) ).
cnf(4430,plain,
( sdtlseqdt0(szszuzczcdt0(X1),X2)
| sdtlseqdt0(X2,X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[4429]) ).
fof(4431,plain,
! [X1,X2] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1)
| equal(X1,X2) ),
inference(fof_nnf,[status(thm)],[69]) ).
fof(4432,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ sdtlseqdt0(X3,X4)
| ~ sdtlseqdt0(X4,X3)
| equal(X3,X4) ),
inference(variable_rename,[status(thm)],[4431]) ).
cnf(4433,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[4432]) ).
fof(4483,negated_conjecture,
( ~ equal(xi,xj)
& ~ sdtlseqdt0(szszuzczcdt0(xj),xi)
& ~ sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(fof_nnf,[status(thm)],[86]) ).
cnf(4484,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(split_conjunct,[status(thm)],[4483]) ).
cnf(4485,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xj),xi),
inference(split_conjunct,[status(thm)],[4483]) ).
cnf(4486,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[4483]) ).
cnf(4711,plain,
( sdtlseqdt0(szszuzczcdt0(X1),xi)
| sdtlseqdt0(xi,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[4430,96,theory(equality)]) ).
cnf(4712,plain,
( sdtlseqdt0(szszuzczcdt0(X1),xj)
| sdtlseqdt0(xj,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[4430,95,theory(equality)]) ).
cnf(4780,plain,
( X1 = xi
| ~ sdtlseqdt0(xi,X1)
| ~ sdtlseqdt0(X1,xi)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[4433,96,theory(equality)]) ).
cnf(39421,plain,
( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(xi,xj) ),
inference(spm,[status(thm)],[4711,95,theory(equality)]) ).
cnf(39471,plain,
sdtlseqdt0(xi,xj),
inference(sr,[status(thm)],[39421,4485,theory(equality)]) ).
cnf(39487,plain,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(xj,xi) ),
inference(spm,[status(thm)],[4712,96,theory(equality)]) ).
cnf(39537,plain,
sdtlseqdt0(xj,xi),
inference(sr,[status(thm)],[39487,4484,theory(equality)]) ).
cnf(51278,plain,
( xj = xi
| ~ sdtlseqdt0(xj,xi)
| ~ aElementOf0(xj,szNzAzT0) ),
inference(spm,[status(thm)],[4780,39471,theory(equality)]) ).
cnf(51282,plain,
( xj = xi
| $false
| ~ aElementOf0(xj,szNzAzT0) ),
inference(rw,[status(thm)],[51278,39537,theory(equality)]) ).
cnf(51283,plain,
( xj = xi
| $false
| $false ),
inference(rw,[status(thm)],[51282,95,theory(equality)]) ).
cnf(51284,plain,
xj = xi,
inference(cn,[status(thm)],[51283,theory(equality)]) ).
cnf(51285,plain,
$false,
inference(sr,[status(thm)],[51284,4486,theory(equality)]) ).
cnf(51286,plain,
$false,
51285,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM576+3 : 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 : n110.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 09:56:30 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 4.94/5.23 -running prover on /export/starexec/sandbox2/tmp/tmpJdS7ux/sel_theBenchmark.p_1 with time limit 29
% 4.94/5.23 -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/tmpJdS7ux/sel_theBenchmark.p_1']
% 4.94/5.23 -prover status Theorem
% 4.94/5.23 Problem theBenchmark.p solved in phase 0.
% 4.94/5.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.94/5.23 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.94/5.23 Solved 1 out of 1.
% 4.94/5.23 # Problem is unsatisfiable (or provable), constructing proof object
% 4.94/5.23 # SZS status Theorem
% 4.94/5.23 # SZS output start CNFRefutation.
% See solution above
% 4.94/5.24 # SZS output end CNFRefutation
%------------------------------------------------------------------------------