TSTP Solution File: SEU137+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU137+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:46:47 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 28 ( 14 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,axiom,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/tmp/tmpsw2xVt/sel_SEU137+2.p_1',t39_xboole_1) ).
fof(19,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> X2 = set_union2(X1,set_difference(X2,X1)) ),
file('/tmp/tmpsw2xVt/sel_SEU137+2.p_1',t45_xboole_1) ).
fof(46,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/tmp/tmpsw2xVt/sel_SEU137+2.p_1',t12_xboole_1) ).
fof(51,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> X2 = set_union2(X1,set_difference(X2,X1)) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(96,plain,
! [X3,X4] : set_union2(X3,set_difference(X4,X3)) = set_union2(X3,X4),
inference(variable_rename,[status(thm)],[12]) ).
cnf(97,plain,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[96]) ).
fof(121,negated_conjecture,
? [X1,X2] :
( subset(X1,X2)
& X2 != set_union2(X1,set_difference(X2,X1)) ),
inference(fof_nnf,[status(thm)],[51]) ).
fof(122,negated_conjecture,
? [X3,X4] :
( subset(X3,X4)
& X4 != set_union2(X3,set_difference(X4,X3)) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,negated_conjecture,
( subset(esk5_0,esk6_0)
& esk6_0 != set_union2(esk5_0,set_difference(esk6_0,esk5_0)) ),
inference(skolemize,[status(esa)],[122]) ).
cnf(124,negated_conjecture,
esk6_0 != set_union2(esk5_0,set_difference(esk6_0,esk5_0)),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(125,negated_conjecture,
subset(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[123]) ).
fof(214,plain,
! [X1,X2] :
( ~ subset(X1,X2)
| set_union2(X1,X2) = X2 ),
inference(fof_nnf,[status(thm)],[46]) ).
fof(215,plain,
! [X3,X4] :
( ~ subset(X3,X4)
| set_union2(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[214]) ).
cnf(216,plain,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[215]) ).
cnf(294,negated_conjecture,
set_union2(esk5_0,esk6_0) != esk6_0,
inference(rw,[status(thm)],[124,97,theory(equality)]) ).
cnf(570,plain,
~ subset(esk5_0,esk6_0),
inference(spm,[status(thm)],[294,216,theory(equality)]) ).
cnf(571,plain,
$false,
inference(rw,[status(thm)],[570,125,theory(equality)]) ).
cnf(572,plain,
$false,
inference(cn,[status(thm)],[571,theory(equality)]) ).
cnf(573,plain,
$false,
572,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU137+2.p
% --creating new selector for []
% -running prover on /tmp/tmpsw2xVt/sel_SEU137+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU137+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU137+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU137+2.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
%
%------------------------------------------------------------------------------