%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM607+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n130.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:58 EST 2018
% Result : Theorem 3.13s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 87 ( 32 ~; 18 |; 31 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
| equal(xQ,slcrc0) ) ),
file('/export/starexec/sandbox2/tmp/tmpsOtWZr/sel_theBenchmark.p_1',m__5093) ).
fof(19,conjecture,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| aElementOf0(xQ,szDzozmdt0(xc)) ),
file('/export/starexec/sandbox2/tmp/tmpsOtWZr/sel_theBenchmark.p_1',m__) ).
fof(47,axiom,
( ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xO,xS) ),
file('/export/starexec/sandbox2/tmp/tmpsOtWZr/sel_theBenchmark.p_1',m__4998) ).
fof(103,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| aElementOf0(xQ,szDzozmdt0(xc)) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(208,plain,
( ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) )
& ? [X1] : aElementOf0(X1,xQ)
& ~ equal(xQ,slcrc0) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(209,plain,
( ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& ? [X3] : aElementOf0(X3,xQ)
& ~ equal(xQ,slcrc0) ),
inference(variable_rename,[status(thm)],[208]) ).
fof(210,plain,
( ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aElementOf0(esk6_0,xQ)
& ~ equal(xQ,slcrc0) ),
inference(skolemize,[status(esa)],[209]) ).
fof(211,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aElementOf0(esk6_0,xQ)
& ~ equal(xQ,slcrc0) ),
inference(shift_quantors,[status(thm)],[210]) ).
cnf(214,plain,
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[211]) ).
fof(229,negated_conjecture,
( ? [X1] :
( aElementOf0(X1,xQ)
& ~ aElementOf0(X1,xS) )
& ~ aSubsetOf0(xQ,xS)
& ? [X1] :
( aElementOf0(X1,xQ)
& ~ aElementOf0(X1,xS) )
& ~ aSubsetOf0(xQ,xS)
& ~ aElementOf0(xQ,szDzozmdt0(xc)) ),
inference(fof_nnf,[status(thm)],[103]) ).
fof(230,negated_conjecture,
( ? [X2] :
( aElementOf0(X2,xQ)
& ~ aElementOf0(X2,xS) )
& ~ aSubsetOf0(xQ,xS)
& ? [X3] :
( aElementOf0(X3,xQ)
& ~ aElementOf0(X3,xS) )
& ~ aSubsetOf0(xQ,xS)
& ~ aElementOf0(xQ,szDzozmdt0(xc)) ),
inference(variable_rename,[status(thm)],[229]) ).
fof(231,negated_conjecture,
( aElementOf0(esk8_0,xQ)
& ~ aElementOf0(esk8_0,xS)
& ~ aSubsetOf0(xQ,xS)
& aElementOf0(esk9_0,xQ)
& ~ aElementOf0(esk9_0,xS)
& ~ aSubsetOf0(xQ,xS)
& ~ aElementOf0(xQ,szDzozmdt0(xc)) ),
inference(skolemize,[status(esa)],[230]) ).
cnf(237,negated_conjecture,
~ aElementOf0(esk8_0,xS),
inference(split_conjunct,[status(thm)],[231]) ).
cnf(238,negated_conjecture,
aElementOf0(esk8_0,xQ),
inference(split_conjunct,[status(thm)],[231]) ).
fof(373,plain,
( ! [X1] :
( ~ aElementOf0(X1,xO)
| aElementOf0(X1,xS) )
& aSubsetOf0(xO,xS) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(374,plain,
( ! [X2] :
( ~ aElementOf0(X2,xO)
| aElementOf0(X2,xS) )
& aSubsetOf0(xO,xS) ),
inference(variable_rename,[status(thm)],[373]) ).
fof(375,plain,
! [X2] :
( ( ~ aElementOf0(X2,xO)
| aElementOf0(X2,xS) )
& aSubsetOf0(xO,xS) ),
inference(shift_quantors,[status(thm)],[374]) ).
cnf(377,plain,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[375]) ).
cnf(5332,negated_conjecture,
aElementOf0(esk8_0,xO),
inference(spm,[status(thm)],[214,238,theory(equality)]) ).
cnf(20968,negated_conjecture,
aElementOf0(esk8_0,xS),
inference(spm,[status(thm)],[377,5332,theory(equality)]) ).
cnf(20979,negated_conjecture,
$false,
inference(sr,[status(thm)],[20968,237,theory(equality)]) ).
cnf(20980,negated_conjecture,
$false,
20979,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM607+3 : 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 : n130.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 10:29:45 CST 2018
% 0.02/0.22 % CPUTime :
% 0.06/0.26 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 3.13/3.34 -running prover on /export/starexec/sandbox2/tmp/tmpsOtWZr/sel_theBenchmark.p_1 with time limit 29
% 3.13/3.34 -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/tmpsOtWZr/sel_theBenchmark.p_1']
% 3.13/3.34 -prover status Theorem
% 3.13/3.34 Problem theBenchmark.p solved in phase 0.
% 3.13/3.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.13/3.34 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.13/3.34 Solved 1 out of 1.
% 3.13/3.34 # Problem is unsatisfiable (or provable), constructing proof object
% 3.13/3.34 # SZS status Theorem
% 3.13/3.34 # SZS output start CNFRefutation.
% See solution above
% 3.13/3.34 # SZS output end CNFRefutation
%------------------------------------------------------------------------------