TSTP Solution File: SEU083+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU083+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 04:33:06 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 35 ( 14 ~; 9 |; 9 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(18,axiom,
! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(set_union2(X1,X2)) ),
file('/tmp/tmpFgzbk9/sel_SEU083+1.p_1',fc9_finset_1) ).
fof(39,conjecture,
! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(set_union2(X1,X2)) ),
file('/tmp/tmpFgzbk9/sel_SEU083+1.p_1',t14_finset_1) ).
fof(63,negated_conjecture,
~ ! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(set_union2(X1,X2)) ),
inference(assume_negation,[status(cth)],[39]) ).
fof(153,plain,
! [X1,X2] :
( ~ finite(X1)
| ~ finite(X2)
| finite(set_union2(X1,X2)) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(154,plain,
! [X3,X4] :
( ~ finite(X3)
| ~ finite(X4)
| finite(set_union2(X3,X4)) ),
inference(variable_rename,[status(thm)],[153]) ).
cnf(155,plain,
( finite(set_union2(X1,X2))
| ~ finite(X2)
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[154]) ).
fof(247,negated_conjecture,
? [X1,X2] :
( finite(X1)
& finite(X2)
& ~ finite(set_union2(X1,X2)) ),
inference(fof_nnf,[status(thm)],[63]) ).
fof(248,negated_conjecture,
? [X3,X4] :
( finite(X3)
& finite(X4)
& ~ finite(set_union2(X3,X4)) ),
inference(variable_rename,[status(thm)],[247]) ).
fof(249,negated_conjecture,
( finite(esk17_0)
& finite(esk18_0)
& ~ finite(set_union2(esk17_0,esk18_0)) ),
inference(skolemize,[status(esa)],[248]) ).
cnf(250,negated_conjecture,
~ finite(set_union2(esk17_0,esk18_0)),
inference(split_conjunct,[status(thm)],[249]) ).
cnf(251,negated_conjecture,
finite(esk18_0),
inference(split_conjunct,[status(thm)],[249]) ).
cnf(252,negated_conjecture,
finite(esk17_0),
inference(split_conjunct,[status(thm)],[249]) ).
cnf(361,negated_conjecture,
( ~ finite(esk18_0)
| ~ finite(esk17_0) ),
inference(spm,[status(thm)],[250,155,theory(equality)]) ).
cnf(362,negated_conjecture,
( $false
| ~ finite(esk17_0) ),
inference(rw,[status(thm)],[361,251,theory(equality)]) ).
cnf(363,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[362,252,theory(equality)]) ).
cnf(364,negated_conjecture,
$false,
inference(cn,[status(thm)],[363,theory(equality)]) ).
cnf(365,negated_conjecture,
$false,
364,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU083+1.p
% --creating new selector for []
% -running prover on /tmp/tmpFgzbk9/sel_SEU083+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU083+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU083+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU083+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------