TSTP Solution File: NUM551+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM551+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n091.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.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 81 ( 7 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 92 ( 39 ~; 35 |; 15 &)
% ( 1 <=>; 2 =>; 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 : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn 21 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpv6rlC_/sel_theBenchmark.p_1',mEOfElem) ).
fof(27,axiom,
~ equal(xQ,slcrc0),
file('/export/starexec/sandbox2/tmp/tmpv6rlC_/sel_theBenchmark.p_1',m__2313) ).
fof(33,axiom,
! [X1] :
( equal(X1,slcrc0)
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpv6rlC_/sel_theBenchmark.p_1',mDefEmp) ).
fof(44,conjecture,
? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
file('/export/starexec/sandbox2/tmp/tmpv6rlC_/sel_theBenchmark.p_1',m__) ).
fof(49,axiom,
( aSet0(xQ)
& isFinite0(xQ)
& equal(sbrdtbr0(xQ),xk) ),
file('/export/starexec/sandbox2/tmp/tmpv6rlC_/sel_theBenchmark.p_1',m__2291) ).
fof(69,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
inference(assume_negation,[status(cth)],[44]) ).
fof(82,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ aElementOf0(X2,X1)
| aElement0(X2) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(83,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4) ) ),
inference(variable_rename,[status(thm)],[82]) ).
fof(84,plain,
! [X3,X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4)
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[83]) ).
cnf(85,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[84]) ).
cnf(187,plain,
xQ != slcrc0,
inference(split_conjunct,[status(thm)],[27]) ).
fof(208,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)],[33]) ).
fof(209,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)],[208]) ).
fof(210,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)],[209]) ).
fof(211,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)],[210]) ).
fof(212,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)],[211]) ).
cnf(213,plain,
( X1 = slcrc0
| aElementOf0(esk6_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[212]) ).
fof(265,negated_conjecture,
! [X1] :
( ~ aElement0(X1)
| ~ aElementOf0(X1,xQ) ),
inference(fof_nnf,[status(thm)],[69]) ).
fof(266,negated_conjecture,
! [X2] :
( ~ aElement0(X2)
| ~ aElementOf0(X2,xQ) ),
inference(variable_rename,[status(thm)],[265]) ).
cnf(267,negated_conjecture,
( ~ aElementOf0(X1,xQ)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[266]) ).
cnf(282,plain,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(414,plain,
( aElement0(esk6_1(X1))
| slcrc0 = X1
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[85,213,theory(equality)]) ).
cnf(870,negated_conjecture,
( slcrc0 = X1
| ~ aElementOf0(esk6_1(X1),xQ)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[267,414,theory(equality)]) ).
cnf(905,negated_conjecture,
( slcrc0 = xQ
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[870,213,theory(equality)]) ).
cnf(906,negated_conjecture,
( slcrc0 = xQ
| $false ),
inference(rw,[status(thm)],[905,282,theory(equality)]) ).
cnf(907,negated_conjecture,
slcrc0 = xQ,
inference(cn,[status(thm)],[906,theory(equality)]) ).
cnf(908,negated_conjecture,
$false,
inference(sr,[status(thm)],[907,187,theory(equality)]) ).
cnf(909,negated_conjecture,
$false,
908,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM551+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.23 % Computer : n091.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.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Fri Jan 5 08:29:30 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.06/0.37 -running prover on /export/starexec/sandbox2/tmp/tmpv6rlC_/sel_theBenchmark.p_1 with time limit 29
% 0.06/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/tmpv6rlC_/sel_theBenchmark.p_1']
% 0.06/0.37 -prover status Theorem
% 0.06/0.37 Problem theBenchmark.p solved in phase 0.
% 0.06/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37 Solved 1 out of 1.
% 0.06/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37 # SZS status Theorem
% 0.06/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------