TSTP Solution File: NUM531+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM531+2 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n095.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:41 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 87 ( 2 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 101 ( 42 ~; 25 |; 29 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn 21 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox/tmp/tmp2KIAk4/sel_theBenchmark.p_1',mEmpFin) ).
fof(6,conjecture,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ ( ~ ? [X2] : aElementOf0(X2,X1)
& equal(X1,slcrc0) ) ),
file('/export/starexec/sandbox/tmp/tmp2KIAk4/sel_theBenchmark.p_1',m__) ).
fof(7,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox/tmp/tmp2KIAk4/sel_theBenchmark.p_1',mCountNFin) ).
fof(8,axiom,
! [X1] :
( equal(X1,slcrc0)
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp2KIAk4/sel_theBenchmark.p_1',mDefEmp) ).
fof(10,negated_conjecture,
~ ! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ ( ~ ? [X2] : aElementOf0(X2,X1)
& equal(X1,slcrc0) ) ),
inference(assume_negation,[status(cth)],[6]) ).
fof(11,plain,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ isFinite0(X1) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
cnf(22,plain,
isFinite0(slcrc0),
inference(split_conjunct,[status(thm)],[4]) ).
fof(26,negated_conjecture,
? [X1] :
( aSet0(X1)
& isCountable0(X1)
& ! [X2] : ~ aElementOf0(X2,X1)
& equal(X1,slcrc0) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(27,negated_conjecture,
? [X3] :
( aSet0(X3)
& isCountable0(X3)
& ! [X4] : ~ aElementOf0(X4,X3)
& equal(X3,slcrc0) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,negated_conjecture,
( aSet0(esk1_0)
& isCountable0(esk1_0)
& ! [X4] : ~ aElementOf0(X4,esk1_0)
& equal(esk1_0,slcrc0) ),
inference(skolemize,[status(esa)],[27]) ).
fof(29,negated_conjecture,
! [X4] :
( ~ aElementOf0(X4,esk1_0)
& equal(esk1_0,slcrc0)
& aSet0(esk1_0)
& isCountable0(esk1_0) ),
inference(shift_quantors,[status(thm)],[28]) ).
cnf(30,negated_conjecture,
isCountable0(esk1_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(32,negated_conjecture,
esk1_0 = slcrc0,
inference(split_conjunct,[status(thm)],[29]) ).
fof(34,plain,
! [X1] :
( ~ aSet0(X1)
| ~ isCountable0(X1)
| ~ isFinite0(X1) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(35,plain,
! [X2] :
( ~ aSet0(X2)
| ~ isCountable0(X2)
| ~ isFinite0(X2) ),
inference(variable_rename,[status(thm)],[34]) ).
cnf(36,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[35]) ).
fof(37,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)],[8]) ).
fof(38,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)],[37]) ).
fof(39,plain,
! [X3] :
( ( ~ equal(X3,slcrc0)
| ( aSet0(X3)
& ! [X4] : ~ aElementOf0(X4,X3) ) )
& ( ~ aSet0(X3)
| aElementOf0(esk2_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(skolemize,[status(esa)],[38]) ).
fof(40,plain,
! [X3,X4] :
( ( ( ~ aElementOf0(X4,X3)
& aSet0(X3) )
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk2_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(shift_quantors,[status(thm)],[39]) ).
fof(41,plain,
! [X3,X4] :
( ( ~ aElementOf0(X4,X3)
| ~ equal(X3,slcrc0) )
& ( aSet0(X3)
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk2_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(43,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(48,negated_conjecture,
isCountable0(slcrc0),
inference(rw,[status(thm)],[30,32,theory(equality)]) ).
cnf(54,negated_conjecture,
( ~ isFinite0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(spm,[status(thm)],[36,48,theory(equality)]) ).
cnf(55,negated_conjecture,
( $false
| ~ aSet0(slcrc0) ),
inference(rw,[status(thm)],[54,22,theory(equality)]) ).
cnf(56,negated_conjecture,
~ aSet0(slcrc0),
inference(cn,[status(thm)],[55,theory(equality)]) ).
cnf(57,negated_conjecture,
$false,
inference(spm,[status(thm)],[56,43,theory(equality)]) ).
cnf(58,negated_conjecture,
$false,
57,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM531+2 : 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 : n095.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 07:28:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.07/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.27 --creating new selector for []
% 0.07/0.34 -running prover on /export/starexec/sandbox/tmp/tmp2KIAk4/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.34 -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/tmp2KIAk4/sel_theBenchmark.p_1']
% 0.07/0.34 -prover status Theorem
% 0.07/0.34 Problem theBenchmark.p solved in phase 0.
% 0.07/0.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34 Solved 1 out of 1.
% 0.07/0.34 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.34 # SZS status Theorem
% 0.07/0.34 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.34 # SZS output end CNFRefutation
%------------------------------------------------------------------------------