TSTP Solution File: SEU097+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU097+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:35:18 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 53 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 22 ~; 12 |; 9 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 1 sgn 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1,X2] :
( finite(X1)
=> finite(set_difference(X1,X2)) ),
file('/tmp/tmpUdrZcp/sel_SEU097+1.p_1',fc12_finset_1) ).
fof(12,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
file('/tmp/tmpUdrZcp/sel_SEU097+1.p_1',d6_xboole_0) ).
fof(21,axiom,
! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(set_union2(X1,X2)) ),
file('/tmp/tmpUdrZcp/sel_SEU097+1.p_1',fc9_finset_1) ).
fof(44,conjecture,
! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(symmetric_difference(X1,X2)) ),
file('/tmp/tmpUdrZcp/sel_SEU097+1.p_1',t28_finset_1) ).
fof(71,negated_conjecture,
~ ! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(symmetric_difference(X1,X2)) ),
inference(assume_negation,[status(cth)],[44]) ).
fof(119,plain,
! [X1,X2] :
( ~ finite(X1)
| finite(set_difference(X1,X2)) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(120,plain,
! [X3,X4] :
( ~ finite(X3)
| finite(set_difference(X3,X4)) ),
inference(variable_rename,[status(thm)],[119]) ).
cnf(121,plain,
( finite(set_difference(X1,X2))
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[120]) ).
fof(129,plain,
! [X3,X4] : symmetric_difference(X3,X4) = set_union2(set_difference(X3,X4),set_difference(X4,X3)),
inference(variable_rename,[status(thm)],[12]) ).
cnf(130,plain,
symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
inference(split_conjunct,[status(thm)],[129]) ).
fof(169,plain,
! [X1,X2] :
( ~ finite(X1)
| ~ finite(X2)
| finite(set_union2(X1,X2)) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(170,plain,
! [X3,X4] :
( ~ finite(X3)
| ~ finite(X4)
| finite(set_union2(X3,X4)) ),
inference(variable_rename,[status(thm)],[169]) ).
cnf(171,plain,
( finite(set_union2(X1,X2))
| ~ finite(X2)
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[170]) ).
fof(264,negated_conjecture,
? [X1,X2] :
( finite(X1)
& finite(X2)
& ~ finite(symmetric_difference(X1,X2)) ),
inference(fof_nnf,[status(thm)],[71]) ).
fof(265,negated_conjecture,
? [X3,X4] :
( finite(X3)
& finite(X4)
& ~ finite(symmetric_difference(X3,X4)) ),
inference(variable_rename,[status(thm)],[264]) ).
fof(266,negated_conjecture,
( finite(esk17_0)
& finite(esk18_0)
& ~ finite(symmetric_difference(esk17_0,esk18_0)) ),
inference(skolemize,[status(esa)],[265]) ).
cnf(267,negated_conjecture,
~ finite(symmetric_difference(esk17_0,esk18_0)),
inference(split_conjunct,[status(thm)],[266]) ).
cnf(268,negated_conjecture,
finite(esk18_0),
inference(split_conjunct,[status(thm)],[266]) ).
cnf(269,negated_conjecture,
finite(esk17_0),
inference(split_conjunct,[status(thm)],[266]) ).
cnf(376,negated_conjecture,
~ finite(set_union2(set_difference(esk17_0,esk18_0),set_difference(esk18_0,esk17_0))),
inference(rw,[status(thm)],[267,130,theory(equality)]),
[unfolding] ).
cnf(600,negated_conjecture,
( ~ finite(set_difference(esk18_0,esk17_0))
| ~ finite(set_difference(esk17_0,esk18_0)) ),
inference(spm,[status(thm)],[376,171,theory(equality)]) ).
cnf(918,negated_conjecture,
( ~ finite(set_difference(esk17_0,esk18_0))
| ~ finite(esk18_0) ),
inference(spm,[status(thm)],[600,121,theory(equality)]) ).
cnf(919,negated_conjecture,
( ~ finite(set_difference(esk17_0,esk18_0))
| $false ),
inference(rw,[status(thm)],[918,268,theory(equality)]) ).
cnf(920,negated_conjecture,
~ finite(set_difference(esk17_0,esk18_0)),
inference(cn,[status(thm)],[919,theory(equality)]) ).
cnf(924,negated_conjecture,
~ finite(esk17_0),
inference(spm,[status(thm)],[920,121,theory(equality)]) ).
cnf(925,negated_conjecture,
$false,
inference(rw,[status(thm)],[924,269,theory(equality)]) ).
cnf(926,negated_conjecture,
$false,
inference(cn,[status(thm)],[925,theory(equality)]) ).
cnf(927,negated_conjecture,
$false,
926,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU097+1.p
% --creating new selector for []
% -running prover on /tmp/tmpUdrZcp/sel_SEU097+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU097+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU097+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU097+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
%
%------------------------------------------------------------------------------