TSTP Solution File: NUM548+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM548+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n069.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:45 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 62 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 61 ( 21 ~; 18 |; 19 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/tmp/tmpE9CBMQ/sel_theBenchmark.p_1',m__2270) ).
fof(43,conjecture,
isFinite0(xQ),
file('/export/starexec/sandbox/tmp/tmpE9CBMQ/sel_theBenchmark.p_1',m__) ).
fof(53,axiom,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmpE9CBMQ/sel_theBenchmark.p_1',m__2202) ).
fof(65,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox/tmp/tmpE9CBMQ/sel_theBenchmark.p_1',mCardNum) ).
fof(67,negated_conjecture,
~ isFinite0(xQ),
inference(assume_negation,[status(cth)],[43]) ).
fof(72,negated_conjecture,
~ isFinite0(xQ),
inference(fof_simplification,[status(thm)],[67,theory(equality)]) ).
fof(85,plain,
( aSet0(xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(86,plain,
( aSet0(xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(variable_rename,[status(thm)],[85]) ).
fof(87,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xS) )
& aSet0(xQ)
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(shift_quantors,[status(thm)],[86]) ).
cnf(89,plain,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[87]) ).
cnf(91,plain,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[87]) ).
cnf(270,negated_conjecture,
~ isFinite0(xQ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(308,plain,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[53]) ).
fof(354,plain,
! [X1] :
( ~ aSet0(X1)
| ( ( ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) )
& ( ~ isFinite0(X1)
| aElementOf0(sbrdtbr0(X1),szNzAzT0) ) ) ),
inference(fof_nnf,[status(thm)],[65]) ).
fof(355,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0) ) ) ),
inference(variable_rename,[status(thm)],[354]) ).
fof(356,plain,
! [X2] :
( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2)
| ~ aSet0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[355]) ).
cnf(358,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[356]) ).
cnf(412,negated_conjecture,
( ~ aElementOf0(sbrdtbr0(xQ),szNzAzT0)
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[270,358,theory(equality)]) ).
cnf(413,negated_conjecture,
( $false
| ~ aSet0(xQ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[412,89,theory(equality)]),308,theory(equality)]) ).
cnf(414,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[413,91,theory(equality)]) ).
cnf(415,negated_conjecture,
$false,
inference(cn,[status(thm)],[414,theory(equality)]) ).
cnf(416,negated_conjecture,
$false,
415,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM548+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.23 % Computer : n069.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 08:24:30 CST 2018
% 0.03/0.23 % CPUTime :
% 0.07/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.27 --creating new selector for []
% 0.07/0.36 -running prover on /export/starexec/sandbox/tmp/tmpE9CBMQ/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.36 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpE9CBMQ/sel_theBenchmark.p_1']
% 0.07/0.36 -prover status Theorem
% 0.07/0.36 Problem theBenchmark.p solved in phase 0.
% 0.07/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36 Solved 1 out of 1.
% 0.07/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.36 # SZS status Theorem
% 0.07/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------