TSTP Solution File: NUM549+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM549+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n071.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:45 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 7 unt; 0 def)
% Number of atoms : 113 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 130 ( 55 ~; 50 |; 20 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn 25 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpWIsrIZ/sel_theBenchmark.p_1',mEOfElem) ).
fof(10,axiom,
( aSet0(xS)
& aSet0(xT)
& ~ equal(xk,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpWIsrIZ/sel_theBenchmark.p_1',m__2202_02) ).
fof(32,axiom,
! [X1] :
( equal(X1,slcrc0)
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpWIsrIZ/sel_theBenchmark.p_1',mDefEmp) ).
fof(43,conjecture,
? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
file('/export/starexec/sandbox2/tmp/tmpWIsrIZ/sel_theBenchmark.p_1',m__) ).
fof(48,axiom,
( aSet0(xQ)
& isFinite0(xQ)
& equal(sbrdtbr0(xQ),xk) ),
file('/export/starexec/sandbox2/tmp/tmpWIsrIZ/sel_theBenchmark.p_1',m__2291) ).
fof(50,axiom,
! [X1] :
( aSet0(X1)
=> ( equal(sbrdtbr0(X1),sz00)
<=> equal(X1,slcrc0) ) ),
file('/export/starexec/sandbox2/tmp/tmpWIsrIZ/sel_theBenchmark.p_1',mCardEmpty) ).
fof(68,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
inference(assume_negation,[status(cth)],[43]) ).
fof(81,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ aElementOf0(X2,X1)
| aElement0(X2) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(82,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4) ) ),
inference(variable_rename,[status(thm)],[81]) ).
fof(83,plain,
! [X3,X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4)
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[82]) ).
cnf(84,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[83]) ).
cnf(112,plain,
xk != sz00,
inference(split_conjunct,[status(thm)],[10]) ).
fof(206,plain,
! [X1] :
( ( ~ equal(X1,slcrc0)
| ( aSet0(X1)
& ! [X2] : ~ aElementOf0(X2,X1) ) )
& ( ~ aSet0(X1)
| ? [X2] : aElementOf0(X2,X1)
| equal(X1,slcrc0) ) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(207,plain,
! [X3] :
( ( ~ equal(X3,slcrc0)
| ( aSet0(X3)
& ! [X4] : ~ aElementOf0(X4,X3) ) )
& ( ~ aSet0(X3)
| ? [X5] : aElementOf0(X5,X3)
| equal(X3,slcrc0) ) ),
inference(variable_rename,[status(thm)],[206]) ).
fof(208,plain,
! [X3] :
( ( ~ equal(X3,slcrc0)
| ( aSet0(X3)
& ! [X4] : ~ aElementOf0(X4,X3) ) )
& ( ~ aSet0(X3)
| aElementOf0(esk6_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(skolemize,[status(esa)],[207]) ).
fof(209,plain,
! [X3,X4] :
( ( ( ~ aElementOf0(X4,X3)
& aSet0(X3) )
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk6_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(shift_quantors,[status(thm)],[208]) ).
fof(210,plain,
! [X3,X4] :
( ( ~ aElementOf0(X4,X3)
| ~ equal(X3,slcrc0) )
& ( aSet0(X3)
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk6_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(distribute,[status(thm)],[209]) ).
cnf(211,plain,
( X1 = slcrc0
| aElementOf0(esk6_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(212,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[210]) ).
fof(263,negated_conjecture,
! [X1] :
( ~ aElement0(X1)
| ~ aElementOf0(X1,xQ) ),
inference(fof_nnf,[status(thm)],[68]) ).
fof(264,negated_conjecture,
! [X2] :
( ~ aElement0(X2)
| ~ aElementOf0(X2,xQ) ),
inference(variable_rename,[status(thm)],[263]) ).
cnf(265,negated_conjecture,
( ~ aElementOf0(X1,xQ)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[264]) ).
cnf(278,plain,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[48]) ).
cnf(280,plain,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(293,plain,
! [X1] :
( ~ aSet0(X1)
| ( ( ~ equal(sbrdtbr0(X1),sz00)
| equal(X1,slcrc0) )
& ( ~ equal(X1,slcrc0)
| equal(sbrdtbr0(X1),sz00) ) ) ),
inference(fof_nnf,[status(thm)],[50]) ).
fof(294,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00) ) ) ),
inference(variable_rename,[status(thm)],[293]) ).
fof(295,plain,
! [X2] :
( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0)
| ~ aSet0(X2) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[294]) ).
cnf(296,plain,
( sbrdtbr0(X1) = sz00
| ~ aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[295]) ).
cnf(386,plain,
( sbrdtbr0(X1) = sz00
| slcrc0 != X1 ),
inference(csr,[status(thm)],[296,212]) ).
cnf(387,plain,
( sz00 = xk
| slcrc0 != xQ ),
inference(spm,[status(thm)],[278,386,theory(equality)]) ).
cnf(389,plain,
xQ != slcrc0,
inference(sr,[status(thm)],[387,112,theory(equality)]) ).
cnf(420,plain,
( aElement0(esk6_1(X1))
| slcrc0 = X1
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[84,211,theory(equality)]) ).
cnf(868,negated_conjecture,
( slcrc0 = X1
| ~ aElementOf0(esk6_1(X1),xQ)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[265,420,theory(equality)]) ).
cnf(903,negated_conjecture,
( slcrc0 = xQ
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[868,211,theory(equality)]) ).
cnf(904,negated_conjecture,
( slcrc0 = xQ
| $false ),
inference(rw,[status(thm)],[903,280,theory(equality)]) ).
cnf(905,negated_conjecture,
slcrc0 = xQ,
inference(cn,[status(thm)],[904,theory(equality)]) ).
cnf(906,negated_conjecture,
$false,
inference(sr,[status(thm)],[905,389,theory(equality)]) ).
cnf(907,negated_conjecture,
$false,
906,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM549+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 : n071.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 08:25:45 CST 2018
% 0.02/0.24 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.07/0.39 -running prover on /export/starexec/sandbox2/tmp/tmpWIsrIZ/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/tmpWIsrIZ/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
%------------------------------------------------------------------------------