TSTP Solution File: NUM568+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM568+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n041.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:49 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 52 ( 10 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 52 ( 21 ~; 23 |; 7 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 17 ( 0 sgn 7 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(20,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( equal(X1,sz00)
| ? [X2] :
( aElementOf0(X2,szNzAzT0)
& equal(X1,szszuzczcdt0(X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpiCwSVw/sel_theBenchmark.p_1',mNatExtra) ).
fof(27,axiom,
~ equal(xK,sz00),
file('/export/starexec/sandbox2/tmp/tmpiCwSVw/sel_theBenchmark.p_1',m__3462) ).
fof(59,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpiCwSVw/sel_theBenchmark.p_1',m__3418) ).
fof(76,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& equal(szszuzczcdt0(X1),xK) ),
file('/export/starexec/sandbox2/tmp/tmpiCwSVw/sel_theBenchmark.p_1',m__) ).
fof(81,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& equal(szszuzczcdt0(X1),xK) ),
inference(assume_negation,[status(cth)],[76]) ).
fof(175,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| equal(X1,sz00)
| ? [X2] :
( aElementOf0(X2,szNzAzT0)
& equal(X1,szszuzczcdt0(X2)) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(176,plain,
! [X3] :
( ~ aElementOf0(X3,szNzAzT0)
| equal(X3,sz00)
| ? [X4] :
( aElementOf0(X4,szNzAzT0)
& equal(X3,szszuzczcdt0(X4)) ) ),
inference(variable_rename,[status(thm)],[175]) ).
fof(177,plain,
! [X3] :
( ~ aElementOf0(X3,szNzAzT0)
| equal(X3,sz00)
| ( aElementOf0(esk5_1(X3),szNzAzT0)
& equal(X3,szszuzczcdt0(esk5_1(X3))) ) ),
inference(skolemize,[status(esa)],[176]) ).
fof(178,plain,
! [X3] :
( ( aElementOf0(esk5_1(X3),szNzAzT0)
| equal(X3,sz00)
| ~ aElementOf0(X3,szNzAzT0) )
& ( equal(X3,szszuzczcdt0(esk5_1(X3)))
| equal(X3,sz00)
| ~ aElementOf0(X3,szNzAzT0) ) ),
inference(distribute,[status(thm)],[177]) ).
cnf(179,plain,
( X1 = sz00
| X1 = szszuzczcdt0(esk5_1(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(180,plain,
( X1 = sz00
| aElementOf0(esk5_1(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(210,plain,
xK != sz00,
inference(split_conjunct,[status(thm)],[27]) ).
cnf(362,plain,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[59]) ).
fof(432,negated_conjecture,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ equal(szszuzczcdt0(X1),xK) ),
inference(fof_nnf,[status(thm)],[81]) ).
fof(433,negated_conjecture,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ~ equal(szszuzczcdt0(X2),xK) ),
inference(variable_rename,[status(thm)],[432]) ).
cnf(434,negated_conjecture,
( szszuzczcdt0(X1) != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[433]) ).
cnf(473,negated_conjecture,
( sz00 = X1
| X1 != xK
| ~ aElementOf0(esk5_1(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[434,179,theory(equality)]) ).
cnf(1071,negated_conjecture,
( sz00 = X1
| X1 != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[473,180]) ).
cnf(1072,plain,
sz00 = xK,
inference(spm,[status(thm)],[1071,362,theory(equality)]) ).
cnf(1085,plain,
$false,
inference(sr,[status(thm)],[1072,210,theory(equality)]) ).
cnf(1086,plain,
$false,
1085,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM568+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.24 % Computer : n041.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Fri Jan 5 09:13:44 CST 2018
% 0.02/0.24 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 0.07/0.39 -running prover on /export/starexec/sandbox2/tmp/tmpiCwSVw/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.39 -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/tmpiCwSVw/sel_theBenchmark.p_1']
% 0.07/0.39 -prover status Theorem
% 0.07/0.39 Problem theBenchmark.p solved in phase 0.
% 0.07/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.39 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.39 Solved 1 out of 1.
% 0.07/0.39 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.39 # SZS status Theorem
% 0.07/0.39 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------