%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM610+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n114.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:59 EST 2018
% Result : Theorem 3.15s
% Output : CNFRefutation 3.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 58 ( 23 ~; 12 |; 19 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 11 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
| equal(xQ,slcrc0) ) ),
file('/export/starexec/sandbox2/tmp/tmprVKQWF/sel_theBenchmark.p_1',m__5093) ).
fof(19,conjecture,
( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xO) )
| aSubsetOf0(xP,xO) ),
file('/export/starexec/sandbox2/tmp/tmprVKQWF/sel_theBenchmark.p_1',m__) ).
fof(79,axiom,
( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xQ) )
& aSubsetOf0(xP,xQ) ),
file('/export/starexec/sandbox2/tmp/tmprVKQWF/sel_theBenchmark.p_1',m__5195) ).
fof(109,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xO) )
| aSubsetOf0(xP,xO) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(214,plain,
( ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) )
& ? [X1] : aElementOf0(X1,xQ)
& ~ equal(xQ,slcrc0) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(215,plain,
( ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& ? [X3] : aElementOf0(X3,xQ)
& ~ equal(xQ,slcrc0) ),
inference(variable_rename,[status(thm)],[214]) ).
fof(216,plain,
( ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aElementOf0(esk6_0,xQ)
& ~ equal(xQ,slcrc0) ),
inference(skolemize,[status(esa)],[215]) ).
fof(217,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aElementOf0(esk6_0,xQ)
& ~ equal(xQ,slcrc0) ),
inference(shift_quantors,[status(thm)],[216]) ).
cnf(220,plain,
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[217]) ).
fof(235,negated_conjecture,
( ? [X1] :
( aElementOf0(X1,xP)
& ~ aElementOf0(X1,xO) )
& ~ aSubsetOf0(xP,xO) ),
inference(fof_nnf,[status(thm)],[109]) ).
fof(236,negated_conjecture,
( ? [X2] :
( aElementOf0(X2,xP)
& ~ aElementOf0(X2,xO) )
& ~ aSubsetOf0(xP,xO) ),
inference(variable_rename,[status(thm)],[235]) ).
fof(237,negated_conjecture,
( aElementOf0(esk8_0,xP)
& ~ aElementOf0(esk8_0,xO)
& ~ aSubsetOf0(xP,xO) ),
inference(skolemize,[status(esa)],[236]) ).
cnf(239,negated_conjecture,
~ aElementOf0(esk8_0,xO),
inference(split_conjunct,[status(thm)],[237]) ).
cnf(240,negated_conjecture,
aElementOf0(esk8_0,xP),
inference(split_conjunct,[status(thm)],[237]) ).
fof(597,plain,
( ! [X1] :
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(fof_nnf,[status(thm)],[79]) ).
fof(598,plain,
( ! [X2] :
( ~ aElementOf0(X2,xP)
| aElementOf0(X2,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(variable_rename,[status(thm)],[597]) ).
fof(599,plain,
! [X2] :
( ( ~ aElementOf0(X2,xP)
| aElementOf0(X2,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(shift_quantors,[status(thm)],[598]) ).
cnf(601,plain,
( aElementOf0(X1,xQ)
| ~ aElementOf0(X1,xP) ),
inference(split_conjunct,[status(thm)],[599]) ).
cnf(5371,negated_conjecture,
aElementOf0(esk8_0,xQ),
inference(spm,[status(thm)],[601,240,theory(equality)]) ).
cnf(22270,negated_conjecture,
aElementOf0(esk8_0,xO),
inference(spm,[status(thm)],[220,5371,theory(equality)]) ).
cnf(22279,negated_conjecture,
$false,
inference(sr,[status(thm)],[22270,239,theory(equality)]) ).
cnf(22280,negated_conjecture,
$false,
22279,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM610+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n114.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Mon Jan 8 08:10:27 CST 2018
% 0.06/0.24 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 3.15/3.40 -running prover on /export/starexec/sandbox2/tmp/tmprVKQWF/sel_theBenchmark.p_1 with time limit 29
% 3.15/3.40 -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/tmprVKQWF/sel_theBenchmark.p_1']
% 3.15/3.40 -prover status Theorem
% 3.15/3.40 Problem theBenchmark.p solved in phase 0.
% 3.15/3.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.15/3.40 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.15/3.40 Solved 1 out of 1.
% 3.15/3.40 # Problem is unsatisfiable (or provable), constructing proof object
% 3.15/3.40 # SZS status Theorem
% 3.15/3.40 # SZS output start CNFRefutation.
% See solution above
% 3.15/3.40 # SZS output end CNFRefutation
%------------------------------------------------------------------------------