TSTP Solution File: NUM550+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM550+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n109.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 : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 104 ( 10 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 118 ( 44 ~; 33 |; 37 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 22 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox2/tmp/tmpuTEhMS/sel_theBenchmark.p_1',m__2270) ).
fof(10,axiom,
( aSet0(xS)
& aSet0(xT)
& ~ equal(xk,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpuTEhMS/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/tmpuTEhMS/sel_theBenchmark.p_1',mDefEmp) ).
fof(43,conjecture,
~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& equal(xQ,slcrc0) ),
file('/export/starexec/sandbox2/tmp/tmpuTEhMS/sel_theBenchmark.p_1',m__) ).
fof(50,axiom,
! [X1] :
( aSet0(X1)
=> ( equal(sbrdtbr0(X1),sz00)
<=> equal(X1,slcrc0) ) ),
file('/export/starexec/sandbox2/tmp/tmpuTEhMS/sel_theBenchmark.p_1',mCardEmpty) ).
fof(68,negated_conjecture,
~ ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& equal(xQ,slcrc0) ),
inference(assume_negation,[status(cth)],[43]) ).
fof(85,plain,
( aSet0(xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(86,plain,
( aSet0(xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(variable_rename,[status(thm)],[85]) ).
fof(87,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xS) )
& aSet0(xQ)
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(shift_quantors,[status(thm)],[86]) ).
cnf(89,plain,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[87]) ).
cnf(119,plain,
xk != sz00,
inference(split_conjunct,[status(thm)],[10]) ).
fof(213,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(214,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)],[213]) ).
fof(215,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)],[214]) ).
fof(216,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)],[215]) ).
fof(217,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)],[216]) ).
cnf(219,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[217]) ).
fof(270,negated_conjecture,
( ! [X1] : ~ aElementOf0(X1,xQ)
& equal(xQ,slcrc0) ),
inference(fof_nnf,[status(thm)],[68]) ).
fof(271,negated_conjecture,
( ! [X2] : ~ aElementOf0(X2,xQ)
& equal(xQ,slcrc0) ),
inference(variable_rename,[status(thm)],[270]) ).
fof(272,negated_conjecture,
! [X2] :
( ~ aElementOf0(X2,xQ)
& equal(xQ,slcrc0) ),
inference(shift_quantors,[status(thm)],[271]) ).
cnf(273,negated_conjecture,
xQ = slcrc0,
inference(split_conjunct,[status(thm)],[272]) ).
fof(302,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(303,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00) ) ) ),
inference(variable_rename,[status(thm)],[302]) ).
fof(304,plain,
! [X2] :
( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0)
| ~ aSet0(X2) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[303]) ).
cnf(305,plain,
( sbrdtbr0(X1) = sz00
| ~ aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[304]) ).
cnf(402,plain,
sbrdtbr0(slcrc0) = xk,
inference(rw,[status(thm)],[89,273,theory(equality)]) ).
cnf(412,plain,
( sbrdtbr0(X1) = sz00
| slcrc0 != X1 ),
inference(csr,[status(thm)],[305,219]) ).
cnf(413,plain,
sz00 = xk,
inference(spm,[status(thm)],[402,412,theory(equality)]) ).
cnf(414,plain,
$false,
inference(sr,[status(thm)],[413,119,theory(equality)]) ).
cnf(415,plain,
$false,
414,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM550+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.05 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n109.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 08:28:16 CST 2018
% 0.03/0.24 % CPUTime :
% 0.03/0.29 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 --creating new selector for []
% 0.07/0.37 -running prover on /export/starexec/sandbox2/tmp/tmpuTEhMS/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.37 -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/tmpuTEhMS/sel_theBenchmark.p_1']
% 0.07/0.37 -prover status Theorem
% 0.07/0.37 Problem theBenchmark.p solved in phase 0.
% 0.07/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.37 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.37 Solved 1 out of 1.
% 0.07/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.37 # SZS status Theorem
% 0.07/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------