TSTP Solution File: SEU129+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU129+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 04:49:11 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 54 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 23 ~; 15 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 2 sgn 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/tmp/tmpYFOjEW/sel_SEU129+2.p_1',t1_xboole_1) ).
fof(24,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/tmp/tmpYFOjEW/sel_SEU129+2.p_1',commutativity_k3_xboole_0) ).
fof(30,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/tmp/tmpYFOjEW/sel_SEU129+2.p_1',t26_xboole_1) ).
fof(31,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/tmp/tmpYFOjEW/sel_SEU129+2.p_1',t19_xboole_1) ).
fof(32,axiom,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/tmp/tmpYFOjEW/sel_SEU129+2.p_1',t17_xboole_1) ).
fof(38,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
inference(assume_negation,[status(cth)],[30]) ).
fof(50,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X2,X3)
| subset(X1,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(51,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[50]) ).
cnf(52,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(130,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[24]) ).
cnf(131,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[130]) ).
fof(145,negated_conjecture,
? [X1,X2,X3] :
( subset(X1,X2)
& ~ subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(146,negated_conjecture,
? [X4,X5,X6] :
( subset(X4,X5)
& ~ subset(set_intersection2(X4,X6),set_intersection2(X5,X6)) ),
inference(variable_rename,[status(thm)],[145]) ).
fof(147,negated_conjecture,
( subset(esk6_0,esk7_0)
& ~ subset(set_intersection2(esk6_0,esk8_0),set_intersection2(esk7_0,esk8_0)) ),
inference(skolemize,[status(esa)],[146]) ).
cnf(148,negated_conjecture,
~ subset(set_intersection2(esk6_0,esk8_0),set_intersection2(esk7_0,esk8_0)),
inference(split_conjunct,[status(thm)],[147]) ).
cnf(149,negated_conjecture,
subset(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[147]) ).
fof(150,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X1,X3)
| subset(X1,set_intersection2(X2,X3)) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(151,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X4,X6)
| subset(X4,set_intersection2(X5,X6)) ),
inference(variable_rename,[status(thm)],[150]) ).
cnf(152,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[151]) ).
fof(153,plain,
! [X3,X4] : subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[32]) ).
cnf(154,plain,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[153]) ).
cnf(191,plain,
subset(set_intersection2(X2,X1),X1),
inference(spm,[status(thm)],[154,131,theory(equality)]) ).
cnf(205,negated_conjecture,
( subset(X1,esk7_0)
| ~ subset(X1,esk6_0) ),
inference(spm,[status(thm)],[52,149,theory(equality)]) ).
cnf(231,plain,
( ~ subset(set_intersection2(esk6_0,esk8_0),esk8_0)
| ~ subset(set_intersection2(esk6_0,esk8_0),esk7_0) ),
inference(spm,[status(thm)],[148,152,theory(equality)]) ).
cnf(962,plain,
( $false
| ~ subset(set_intersection2(esk6_0,esk8_0),esk7_0) ),
inference(rw,[status(thm)],[231,191,theory(equality)]) ).
cnf(963,plain,
~ subset(set_intersection2(esk6_0,esk8_0),esk7_0),
inference(cn,[status(thm)],[962,theory(equality)]) ).
cnf(966,negated_conjecture,
~ subset(set_intersection2(esk6_0,esk8_0),esk6_0),
inference(spm,[status(thm)],[963,205,theory(equality)]) ).
cnf(976,negated_conjecture,
$false,
inference(rw,[status(thm)],[966,154,theory(equality)]) ).
cnf(977,negated_conjecture,
$false,
inference(cn,[status(thm)],[976,theory(equality)]) ).
cnf(978,negated_conjecture,
$false,
977,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU129+2.p
% --creating new selector for []
% -running prover on /tmp/tmpYFOjEW/sel_SEU129+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU129+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU129+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU129+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
%
%------------------------------------------------------------------------------