%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM531+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n133.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.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 78 ( 2 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 87 ( 36 ~; 25 |; 21 &)
% ( 1 <=>; 4 =>; 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 : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 24 ( 0 sgn 17 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox2/tmp/tmp3i1_Fd/sel_theBenchmark.p_1',mEmpFin) ).
fof(6,conjecture,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ equal(X1,slcrc0) ),
file('/export/starexec/sandbox2/tmp/tmp3i1_Fd/sel_theBenchmark.p_1',m__) ).
fof(7,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox2/tmp/tmp3i1_Fd/sel_theBenchmark.p_1',mCountNFin) ).
fof(8,axiom,
! [X1] :
( equal(X1,slcrc0)
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp3i1_Fd/sel_theBenchmark.p_1',mDefEmp) ).
fof(10,negated_conjecture,
~ ! [X1] :
( ( aSet0(X1)
& isCountable0(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)
& equal(X1,slcrc0) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(27,negated_conjecture,
? [X2] :
( aSet0(X2)
& isCountable0(X2)
& equal(X2,slcrc0) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,negated_conjecture,
( aSet0(esk1_0)
& isCountable0(esk1_0)
& equal(esk1_0,slcrc0) ),
inference(skolemize,[status(esa)],[27]) ).
cnf(29,negated_conjecture,
esk1_0 = slcrc0,
inference(split_conjunct,[status(thm)],[28]) ).
cnf(30,negated_conjecture,
isCountable0(esk1_0),
inference(split_conjunct,[status(thm)],[28]) ).
fof(32,plain,
! [X1] :
( ~ aSet0(X1)
| ~ isCountable0(X1)
| ~ isFinite0(X1) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(33,plain,
! [X2] :
( ~ aSet0(X2)
| ~ isCountable0(X2)
| ~ isFinite0(X2) ),
inference(variable_rename,[status(thm)],[32]) ).
cnf(34,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,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(36,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)],[35]) ).
fof(37,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)],[36]) ).
fof(38,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)],[37]) ).
fof(39,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)],[38]) ).
cnf(41,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(46,negated_conjecture,
isCountable0(slcrc0),
inference(rw,[status(thm)],[30,29,theory(equality)]) ).
cnf(50,negated_conjecture,
( ~ isFinite0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(spm,[status(thm)],[34,46,theory(equality)]) ).
cnf(51,negated_conjecture,
( $false
| ~ aSet0(slcrc0) ),
inference(rw,[status(thm)],[50,22,theory(equality)]) ).
cnf(52,negated_conjecture,
~ aSet0(slcrc0),
inference(cn,[status(thm)],[51,theory(equality)]) ).
cnf(53,negated_conjecture,
$false,
inference(spm,[status(thm)],[52,41,theory(equality)]) ).
cnf(54,negated_conjecture,
$false,
53,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM531+1 : TPTP v7.0.0. Released v4.0.0.
% 0.02/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.22 % Computer : n133.star.cs.uiowa.edu
% 0.03/0.22 % Model : x86_64 x86_64
% 0.03/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.22 % Memory : 32218.625MB
% 0.03/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.22 % CPULimit : 300
% 0.03/0.22 % DateTime : Fri Jan 5 07:38:30 CST 2018
% 0.03/0.22 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.33 -running prover on /export/starexec/sandbox2/tmp/tmp3i1_Fd/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.33 -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/tmp3i1_Fd/sel_theBenchmark.p_1']
% 0.06/0.33 -prover status Theorem
% 0.06/0.33 Problem theBenchmark.p solved in phase 0.
% 0.06/0.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.33 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.33 Solved 1 out of 1.
% 0.06/0.33 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.33 # SZS status Theorem
% 0.06/0.33 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.33 # SZS output end CNFRefutation
%------------------------------------------------------------------------------