%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM532+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:41 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 97 ( 40 ~; 38 |; 16 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
aSet0(xA),
file('/export/starexec/sandbox2/tmp/tmpvh6u7z/sel_theBenchmark.p_1',m__467) ).
fof(7,conjecture,
aSubsetOf0(xA,xA),
file('/export/starexec/sandbox2/tmp/tmpvh6u7z/sel_theBenchmark.p_1',m__) ).
fof(9,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpvh6u7z/sel_theBenchmark.p_1',mDefSub) ).
fof(14,negated_conjecture,
~ aSubsetOf0(xA,xA),
inference(assume_negation,[status(cth)],[7]) ).
fof(15,negated_conjecture,
~ aSubsetOf0(xA,xA),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
cnf(28,plain,
aSet0(xA),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(32,negated_conjecture,
~ aSubsetOf0(xA,xA),
inference(split_conjunct,[status(thm)],[15]) ).
fof(36,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ( ~ aSubsetOf0(X2,X1)
| ( aSet0(X2)
& ! [X3] :
( ~ aElementOf0(X3,X2)
| aElementOf0(X3,X1) ) ) )
& ( ~ aSet0(X2)
| ? [X3] :
( aElementOf0(X3,X2)
& ~ aElementOf0(X3,X1) )
| aSubsetOf0(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(37,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ? [X7] :
( aElementOf0(X7,X5)
& ~ aElementOf0(X7,X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[36]) ).
fof(38,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk1_2(X4,X5),X5)
& ~ aElementOf0(esk1_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[37]) ).
fof(39,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) )
& aSet0(X5) )
| ~ aSubsetOf0(X5,X4) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk1_2(X4,X5),X5)
& ~ aElementOf0(esk1_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) )
| ~ aSet0(X4) ),
inference(shift_quantors,[status(thm)],[38]) ).
fof(40,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk1_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk1_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[39]) ).
cnf(41,plain,
( aSubsetOf0(X2,X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(42,plain,
( aSubsetOf0(X2,X1)
| aElementOf0(esk1_2(X1,X2),X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(68,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[41,42,theory(equality)]) ).
cnf(69,negated_conjecture,
~ aSet0(xA),
inference(spm,[status(thm)],[32,68,theory(equality)]) ).
cnf(73,negated_conjecture,
$false,
inference(rw,[status(thm)],[69,28,theory(equality)]) ).
cnf(74,negated_conjecture,
$false,
inference(cn,[status(thm)],[73,theory(equality)]) ).
cnf(75,negated_conjecture,
$false,
74,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM532+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.22 % Computer : n091.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.625MB
% 0.02/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Fri Jan 5 08:29:45 CST 2018
% 0.02/0.22 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.06/0.33 -running prover on /export/starexec/sandbox2/tmp/tmpvh6u7z/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/tmpvh6u7z/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.34 Solved 1 out of 1.
% 0.06/0.34 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.34 # SZS status Theorem
% 0.06/0.34 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.34 # SZS output end CNFRefutation
%------------------------------------------------------------------------------