TSTP Solution File: NUM568+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM568+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n033.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 2.12s
% Output : CNFRefutation 2.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 52 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 45 ( 17 ~; 20 |; 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 : 15 ( 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/tmp2iXbCX/sel_theBenchmark.p_1',mNatExtra) ).
fof(27,axiom,
~ equal(xK,sz00),
file('/export/starexec/sandbox2/tmp/tmp2iXbCX/sel_theBenchmark.p_1',m__3462) ).
fof(59,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp2iXbCX/sel_theBenchmark.p_1',m__3418) ).
fof(76,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& equal(szszuzczcdt0(X1),xK) ),
file('/export/starexec/sandbox2/tmp/tmp2iXbCX/sel_theBenchmark.p_1',m__) ).
fof(81,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& equal(szszuzczcdt0(X1),xK) ),
inference(assume_negation,[status(cth)],[76]) ).
fof(192,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| equal(X1,sz00)
| ? [X2] :
( aElementOf0(X2,szNzAzT0)
& equal(X1,szszuzczcdt0(X2)) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(193,plain,
! [X3] :
( ~ aElementOf0(X3,szNzAzT0)
| equal(X3,sz00)
| ? [X4] :
( aElementOf0(X4,szNzAzT0)
& equal(X3,szszuzczcdt0(X4)) ) ),
inference(variable_rename,[status(thm)],[192]) ).
fof(194,plain,
! [X3] :
( ~ aElementOf0(X3,szNzAzT0)
| equal(X3,sz00)
| ( aElementOf0(esk7_1(X3),szNzAzT0)
& equal(X3,szszuzczcdt0(esk7_1(X3))) ) ),
inference(skolemize,[status(esa)],[193]) ).
fof(195,plain,
! [X3] :
( ( aElementOf0(esk7_1(X3),szNzAzT0)
| equal(X3,sz00)
| ~ aElementOf0(X3,szNzAzT0) )
& ( equal(X3,szszuzczcdt0(esk7_1(X3)))
| equal(X3,sz00)
| ~ aElementOf0(X3,szNzAzT0) ) ),
inference(distribute,[status(thm)],[194]) ).
cnf(196,plain,
( X1 = sz00
| X1 = szszuzczcdt0(esk7_1(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[195]) ).
cnf(197,plain,
( X1 = sz00
| aElementOf0(esk7_1(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[195]) ).
cnf(227,plain,
xK != sz00,
inference(split_conjunct,[status(thm)],[27]) ).
cnf(4344,plain,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[59]) ).
fof(4419,negated_conjecture,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ equal(szszuzczcdt0(X1),xK) ),
inference(fof_nnf,[status(thm)],[81]) ).
fof(4420,negated_conjecture,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ~ equal(szszuzczcdt0(X2),xK) ),
inference(variable_rename,[status(thm)],[4419]) ).
cnf(4421,negated_conjecture,
( szszuzczcdt0(X1) != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[4420]) ).
cnf(4462,plain,
( sz00 = xK
| aElementOf0(esk7_1(xK),szNzAzT0) ),
inference(spm,[status(thm)],[197,4344,theory(equality)]) ).
cnf(4463,plain,
aElementOf0(esk7_1(xK),szNzAzT0),
inference(sr,[status(thm)],[4462,227,theory(equality)]) ).
cnf(4477,plain,
( szszuzczcdt0(esk7_1(xK)) = xK
| sz00 = xK ),
inference(spm,[status(thm)],[196,4344,theory(equality)]) ).
cnf(4478,plain,
szszuzczcdt0(esk7_1(xK)) = xK,
inference(sr,[status(thm)],[4477,227,theory(equality)]) ).
cnf(10872,plain,
~ aElementOf0(esk7_1(xK),szNzAzT0),
inference(spm,[status(thm)],[4421,4478,theory(equality)]) ).
cnf(10877,plain,
$false,
inference(rw,[status(thm)],[10872,4463,theory(equality)]) ).
cnf(10878,plain,
$false,
inference(cn,[status(thm)],[10877,theory(equality)]) ).
cnf(10879,plain,
$false,
10878,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM568+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n033.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 09:56:15 CST 2018
% 0.03/0.24 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 2.12/2.33 -running prover on /export/starexec/sandbox2/tmp/tmp2iXbCX/sel_theBenchmark.p_1 with time limit 29
% 2.12/2.33 -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/tmp2iXbCX/sel_theBenchmark.p_1']
% 2.12/2.33 -prover status Theorem
% 2.12/2.33 Problem theBenchmark.p solved in phase 0.
% 2.12/2.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.12/2.33 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.12/2.34 Solved 1 out of 1.
% 2.12/2.34 # Problem is unsatisfiable (or provable), constructing proof object
% 2.12/2.34 # SZS status Theorem
% 2.12/2.34 # SZS output start CNFRefutation.
% See solution above
% 2.12/2.34 # SZS output end CNFRefutation
%------------------------------------------------------------------------------