TSTP Solution File: NUM606+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM606+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n127.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.09s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 79 ( 27 ~; 16 |; 31 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 15 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
| equal(xQ,slcrc0) ) ),
file('/export/starexec/sandbox2/tmp/tmpFAlWF_/sel_theBenchmark.p_1',m__5093) ).
fof(19,conjecture,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,szNzAzT0) )
| aSubsetOf0(xQ,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpFAlWF_/sel_theBenchmark.p_1',m__) ).
fof(22,axiom,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmpFAlWF_/sel_theBenchmark.p_1',m__3435) ).
fof(47,axiom,
( ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xO,xS) ),
file('/export/starexec/sandbox2/tmp/tmpFAlWF_/sel_theBenchmark.p_1',m__4998) ).
fof(102,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,szNzAzT0) )
| aSubsetOf0(xQ,szNzAzT0) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(207,plain,
( ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) )
& ? [X1] : aElementOf0(X1,xQ)
& ~ equal(xQ,slcrc0) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(208,plain,
( ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& ? [X3] : aElementOf0(X3,xQ)
& ~ equal(xQ,slcrc0) ),
inference(variable_rename,[status(thm)],[207]) ).
fof(209,plain,
( ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aElementOf0(esk6_0,xQ)
& ~ equal(xQ,slcrc0) ),
inference(skolemize,[status(esa)],[208]) ).
fof(210,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aElementOf0(esk6_0,xQ)
& ~ equal(xQ,slcrc0) ),
inference(shift_quantors,[status(thm)],[209]) ).
cnf(213,plain,
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[210]) ).
fof(228,negated_conjecture,
( ? [X1] :
( aElementOf0(X1,xQ)
& ~ aElementOf0(X1,szNzAzT0) )
& ~ aSubsetOf0(xQ,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[102]) ).
fof(229,negated_conjecture,
( ? [X2] :
( aElementOf0(X2,xQ)
& ~ aElementOf0(X2,szNzAzT0) )
& ~ aSubsetOf0(xQ,szNzAzT0) ),
inference(variable_rename,[status(thm)],[228]) ).
fof(230,negated_conjecture,
( aElementOf0(esk8_0,xQ)
& ~ aElementOf0(esk8_0,szNzAzT0)
& ~ aSubsetOf0(xQ,szNzAzT0) ),
inference(skolemize,[status(esa)],[229]) ).
cnf(232,negated_conjecture,
~ aElementOf0(esk8_0,szNzAzT0),
inference(split_conjunct,[status(thm)],[230]) ).
cnf(233,negated_conjecture,
aElementOf0(esk8_0,xQ),
inference(split_conjunct,[status(thm)],[230]) ).
fof(246,plain,
( aSet0(xS)
& ! [X1] :
( ~ aElementOf0(X1,xS)
| aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(247,plain,
( aSet0(xS)
& ! [X2] :
( ~ aElementOf0(X2,xS)
| aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(variable_rename,[status(thm)],[246]) ).
fof(248,plain,
! [X2] :
( ( ~ aElementOf0(X2,xS)
| aElementOf0(X2,szNzAzT0) )
& aSet0(xS)
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(shift_quantors,[status(thm)],[247]) ).
cnf(252,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[248]) ).
fof(368,plain,
( ! [X1] :
( ~ aElementOf0(X1,xO)
| aElementOf0(X1,xS) )
& aSubsetOf0(xO,xS) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(369,plain,
( ! [X2] :
( ~ aElementOf0(X2,xO)
| aElementOf0(X2,xS) )
& aSubsetOf0(xO,xS) ),
inference(variable_rename,[status(thm)],[368]) ).
fof(370,plain,
! [X2] :
( ( ~ aElementOf0(X2,xO)
| aElementOf0(X2,xS) )
& aSubsetOf0(xO,xS) ),
inference(shift_quantors,[status(thm)],[369]) ).
cnf(372,plain,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[370]) ).
cnf(5326,negated_conjecture,
aElementOf0(esk8_0,xO),
inference(spm,[status(thm)],[213,233,theory(equality)]) ).
cnf(20712,negated_conjecture,
aElementOf0(esk8_0,xS),
inference(spm,[status(thm)],[372,5326,theory(equality)]) ).
cnf(20731,negated_conjecture,
aElementOf0(esk8_0,szNzAzT0),
inference(spm,[status(thm)],[252,20712,theory(equality)]) ).
cnf(20736,negated_conjecture,
$false,
inference(sr,[status(thm)],[20731,232,theory(equality)]) ).
cnf(20737,negated_conjecture,
$false,
20736,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM606+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.25 % Computer : n127.star.cs.uiowa.edu
% 0.03/0.25 % Model : x86_64 x86_64
% 0.03/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.25 % Memory : 32218.625MB
% 0.03/0.25 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.25 % CPULimit : 300
% 0.03/0.25 % DateTime : Fri Jan 5 10:29:45 CST 2018
% 0.03/0.25 % CPUTime :
% 0.03/0.29 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 --creating new selector for []
% 3.09/3.35 -running prover on /export/starexec/sandbox2/tmp/tmpFAlWF_/sel_theBenchmark.p_1 with time limit 29
% 3.09/3.35 -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/tmpFAlWF_/sel_theBenchmark.p_1']
% 3.09/3.35 -prover status Theorem
% 3.09/3.35 Problem theBenchmark.p solved in phase 0.
% 3.09/3.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.09/3.35 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.09/3.35 Solved 1 out of 1.
% 3.09/3.35 # Problem is unsatisfiable (or provable), constructing proof object
% 3.09/3.35 # SZS status Theorem
% 3.09/3.35 # SZS output start CNFRefutation.
% See solution above
% 3.09/3.35 # SZS output end CNFRefutation
%------------------------------------------------------------------------------