TSTP Solution File: NUM610+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM610+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n060.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:59 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 148 ( 62 ~; 60 |; 21 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 27 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpbf57WV/sel_theBenchmark.p_1',mDefSub) ).
fof(11,axiom,
( aSet0(xO)
& equal(xO,sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))) ),
file('/export/starexec/sandbox/tmp/tmpbf57WV/sel_theBenchmark.p_1',m__4891) ).
fof(14,axiom,
( aSubsetOf0(xQ,xO)
& ~ equal(xQ,slcrc0) ),
file('/export/starexec/sandbox/tmp/tmpbf57WV/sel_theBenchmark.p_1',m__5093) ).
fof(19,conjecture,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox/tmp/tmpbf57WV/sel_theBenchmark.p_1',m__) ).
fof(79,axiom,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/tmp/tmpbf57WV/sel_theBenchmark.p_1',m__5195) ).
fof(103,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmpbf57WV/sel_theBenchmark.p_1',mSubTrans) ).
fof(109,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(assume_negation,[status(cth)],[19]) ).
fof(111,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(fof_simplification,[status(thm)],[109,theory(equality)]) ).
fof(149,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ( ~ aSubsetOf0(X2,X1)
| ( aSet0(X2)
& ! [X3] :
( ~ aElementOf0(X3,X2)
| aElementOf0(X3,X1) ) ) )
& ( ~ aSet0(X2)
| ? [X3] :
( aElementOf0(X3,X2)
& ~ aElementOf0(X3,X1) )
| aSubsetOf0(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(150,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ? [X7] :
( aElementOf0(X7,X5)
& ~ aElementOf0(X7,X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[149]) ).
fof(151,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk2_2(X4,X5),X5)
& ~ aElementOf0(esk2_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[150]) ).
fof(152,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) )
& aSet0(X5) )
| ~ aSubsetOf0(X5,X4) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk2_2(X4,X5),X5)
& ~ aElementOf0(esk2_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) )
| ~ aSet0(X4) ),
inference(shift_quantors,[status(thm)],[151]) ).
fof(153,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk2_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk2_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[152]) ).
cnf(156,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[153]) ).
cnf(175,plain,
aSet0(xO),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(192,plain,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(207,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(split_conjunct,[status(thm)],[111]) ).
cnf(475,plain,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[79]) ).
fof(552,plain,
! [X1,X2,X3] :
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| aSubsetOf0(X1,X3) ),
inference(fof_nnf,[status(thm)],[103]) ).
fof(553,plain,
! [X4,X5,X6] :
( ~ aSet0(X4)
| ~ aSet0(X5)
| ~ aSet0(X6)
| ~ aSubsetOf0(X4,X5)
| ~ aSubsetOf0(X5,X6)
| aSubsetOf0(X4,X6) ),
inference(variable_rename,[status(thm)],[552]) ).
cnf(554,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[553]) ).
cnf(974,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[554,156]) ).
cnf(975,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[974,156]) ).
cnf(977,plain,
( aSubsetOf0(X1,xO)
| ~ aSubsetOf0(X1,xQ)
| ~ aSet0(xO) ),
inference(spm,[status(thm)],[975,192,theory(equality)]) ).
cnf(987,plain,
( aSubsetOf0(X1,xO)
| ~ aSubsetOf0(X1,xQ)
| $false ),
inference(rw,[status(thm)],[977,175,theory(equality)]) ).
cnf(988,plain,
( aSubsetOf0(X1,xO)
| ~ aSubsetOf0(X1,xQ) ),
inference(cn,[status(thm)],[987,theory(equality)]) ).
cnf(2033,plain,
aSubsetOf0(xP,xO),
inference(spm,[status(thm)],[988,475,theory(equality)]) ).
cnf(2037,plain,
$false,
inference(sr,[status(thm)],[2033,207,theory(equality)]) ).
cnf(2038,plain,
$false,
2037,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM610+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.22 % Computer : n060.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.625MB
% 0.02/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Fri Jan 5 10:36:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.06/0.40 -running prover on /export/starexec/sandbox/tmp/tmpbf57WV/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.40 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpbf57WV/sel_theBenchmark.p_1']
% 0.06/0.40 -prover status Theorem
% 0.06/0.40 Problem theBenchmark.p solved in phase 0.
% 0.06/0.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.40 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.40 Solved 1 out of 1.
% 0.06/0.40 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.40 # SZS status Theorem
% 0.06/0.40 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.40 # SZS output end CNFRefutation
%------------------------------------------------------------------------------