TSTP Solution File: NUM605+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM605+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:58 EST 2018
% Result : Theorem 0.69s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 103 ( 11 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 116 ( 44 ~; 33 |; 35 &)
% ( 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 22 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(18,conjecture,
~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& equal(xQ,slcrc0) ),
file('/export/starexec/sandbox/tmp/tmp6Vegz0/sel_theBenchmark.p_1',m__) ).
fof(68,axiom,
~ equal(xK,sz00),
file('/export/starexec/sandbox/tmp/tmp6Vegz0/sel_theBenchmark.p_1',m__3462) ).
fof(77,axiom,
! [X1] :
( aSet0(X1)
=> ( equal(sbrdtbr0(X1),sz00)
<=> equal(X1,slcrc0) ) ),
file('/export/starexec/sandbox/tmp/tmp6Vegz0/sel_theBenchmark.p_1',mCardEmpty) ).
fof(92,axiom,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox/tmp/tmp6Vegz0/sel_theBenchmark.p_1',m__5078) ).
fof(93,axiom,
! [X1] :
( equal(X1,slcrc0)
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp6Vegz0/sel_theBenchmark.p_1',mDefEmp) ).
fof(101,negated_conjecture,
~ ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& equal(xQ,slcrc0) ),
inference(assume_negation,[status(cth)],[18]) ).
fof(220,negated_conjecture,
( ! [X1] : ~ aElementOf0(X1,xQ)
& equal(xQ,slcrc0) ),
inference(fof_nnf,[status(thm)],[101]) ).
fof(221,negated_conjecture,
( ! [X2] : ~ aElementOf0(X2,xQ)
& equal(xQ,slcrc0) ),
inference(variable_rename,[status(thm)],[220]) ).
fof(222,negated_conjecture,
! [X2] :
( ~ aElementOf0(X2,xQ)
& equal(xQ,slcrc0) ),
inference(shift_quantors,[status(thm)],[221]) ).
cnf(223,negated_conjecture,
xQ = slcrc0,
inference(split_conjunct,[status(thm)],[222]) ).
cnf(489,plain,
xK != sz00,
inference(split_conjunct,[status(thm)],[68]) ).
fof(568,plain,
! [X1] :
( ~ aSet0(X1)
| ( ( ~ equal(sbrdtbr0(X1),sz00)
| equal(X1,slcrc0) )
& ( ~ equal(X1,slcrc0)
| equal(sbrdtbr0(X1),sz00) ) ) ),
inference(fof_nnf,[status(thm)],[77]) ).
fof(569,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00) ) ) ),
inference(variable_rename,[status(thm)],[568]) ).
fof(570,plain,
! [X2] :
( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0)
| ~ aSet0(X2) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[569]) ).
cnf(571,plain,
( sbrdtbr0(X1) = sz00
| ~ aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[570]) ).
fof(4595,plain,
( aSet0(xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(fof_nnf,[status(thm)],[92]) ).
fof(4596,plain,
( aSet0(xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(variable_rename,[status(thm)],[4595]) ).
fof(4597,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSet0(xQ)
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(shift_quantors,[status(thm)],[4596]) ).
cnf(4599,plain,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[4597]) ).
fof(4603,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)],[93]) ).
fof(4604,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)],[4603]) ).
fof(4605,plain,
! [X3] :
( ( ~ equal(X3,slcrc0)
| ( aSet0(X3)
& ! [X4] : ~ aElementOf0(X4,X3) ) )
& ( ~ aSet0(X3)
| aElementOf0(esk35_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(skolemize,[status(esa)],[4604]) ).
fof(4606,plain,
! [X3,X4] :
( ( ( ~ aElementOf0(X4,X3)
& aSet0(X3) )
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk35_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(shift_quantors,[status(thm)],[4605]) ).
fof(4607,plain,
! [X3,X4] :
( ( ~ aElementOf0(X4,X3)
| ~ equal(X3,slcrc0) )
& ( aSet0(X3)
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk35_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(distribute,[status(thm)],[4606]) ).
cnf(4609,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[4607]) ).
cnf(5312,plain,
sbrdtbr0(slcrc0) = xK,
inference(rw,[status(thm)],[4599,223,theory(equality)]) ).
cnf(5356,plain,
( sbrdtbr0(X1) = sz00
| slcrc0 != X1 ),
inference(csr,[status(thm)],[571,4609]) ).
cnf(5357,plain,
sbrdtbr0(slcrc0) = sz00,
inference(er,[status(thm)],[5356,theory(equality)]) ).
cnf(5358,plain,
xK = sz00,
inference(rw,[status(thm)],[5357,5312,theory(equality)]) ).
cnf(5359,plain,
$false,
inference(sr,[status(thm)],[5358,489,theory(equality)]) ).
cnf(5360,plain,
$false,
5359,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM605+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n109.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 10:27:00 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.69/0.93 -running prover on /export/starexec/sandbox/tmp/tmp6Vegz0/sel_theBenchmark.p_1 with time limit 29
% 0.69/0.93 -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/tmp6Vegz0/sel_theBenchmark.p_1']
% 0.69/0.93 -prover status Theorem
% 0.69/0.93 Problem theBenchmark.p solved in phase 0.
% 0.69/0.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.93 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.93 Solved 1 out of 1.
% 0.69/0.93 # Problem is unsatisfiable (or provable), constructing proof object
% 0.69/0.93 # SZS status Theorem
% 0.69/0.93 # SZS output start CNFRefutation.
% See solution above
% 0.69/0.93 # SZS output end CNFRefutation
%------------------------------------------------------------------------------