TSTP Solution File: SEU102+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU102+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:36:09 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 114 ( 8 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 128 ( 50 ~; 38 |; 30 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 58 ( 0 sgn 37 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/tmp/tmpyMxKBx/sel_SEU102+1.p_1',redefinition_k2_finsub_1) ).
fof(28,conjecture,
! [X1,X2,X3] :
( ( ~ empty(X3)
& preboolean(X3) )
=> ( ( element(X1,X3)
& element(X2,X3) )
=> element(set_intersection2(X1,X2),X3) ) ),
file('/tmp/tmpyMxKBx/sel_SEU102+1.p_1',t13_finsub_1) ).
fof(29,axiom,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
file('/tmp/tmpyMxKBx/sel_SEU102+1.p_1',dt_k2_finsub_1) ).
fof(34,axiom,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/tmp/tmpyMxKBx/sel_SEU102+1.p_1',t48_xboole_1) ).
fof(39,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ empty(X3)
& preboolean(X3) )
=> ( ( element(X1,X3)
& element(X2,X3) )
=> element(set_intersection2(X1,X2),X3) ) ),
inference(assume_negation,[status(cth)],[28]) ).
fof(41,plain,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(48,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ empty(X3)
& preboolean(X3) )
=> ( ( element(X1,X3)
& element(X2,X3) )
=> element(set_intersection2(X1,X2),X3) ) ),
inference(fof_simplification,[status(thm)],[39,theory(equality)]) ).
fof(49,plain,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[29,theory(equality)]) ).
fof(64,plain,
! [X1,X2,X3] :
( empty(X1)
| ~ preboolean(X1)
| ~ element(X2,X1)
| ~ element(X3,X1)
| prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(65,plain,
! [X4,X5,X6] :
( empty(X4)
| ~ preboolean(X4)
| ~ element(X5,X4)
| ~ element(X6,X4)
| prebool_difference(X4,X5,X6) = set_difference(X5,X6) ),
inference(variable_rename,[status(thm)],[64]) ).
cnf(66,plain,
( prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1)
| ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(150,negated_conjecture,
? [X1,X2,X3] :
( ~ empty(X3)
& preboolean(X3)
& element(X1,X3)
& element(X2,X3)
& ~ element(set_intersection2(X1,X2),X3) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(151,negated_conjecture,
? [X4,X5,X6] :
( ~ empty(X6)
& preboolean(X6)
& element(X4,X6)
& element(X5,X6)
& ~ element(set_intersection2(X4,X5),X6) ),
inference(variable_rename,[status(thm)],[150]) ).
fof(152,negated_conjecture,
( ~ empty(esk9_0)
& preboolean(esk9_0)
& element(esk7_0,esk9_0)
& element(esk8_0,esk9_0)
& ~ element(set_intersection2(esk7_0,esk8_0),esk9_0) ),
inference(skolemize,[status(esa)],[151]) ).
cnf(153,negated_conjecture,
~ element(set_intersection2(esk7_0,esk8_0),esk9_0),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(154,negated_conjecture,
element(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(155,negated_conjecture,
element(esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(156,negated_conjecture,
preboolean(esk9_0),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(157,negated_conjecture,
~ empty(esk9_0),
inference(split_conjunct,[status(thm)],[152]) ).
fof(158,plain,
! [X1,X2,X3] :
( empty(X1)
| ~ preboolean(X1)
| ~ element(X2,X1)
| ~ element(X3,X1)
| element(prebool_difference(X1,X2,X3),X1) ),
inference(fof_nnf,[status(thm)],[49]) ).
fof(159,plain,
! [X4,X5,X6] :
( empty(X4)
| ~ preboolean(X4)
| ~ element(X5,X4)
| ~ element(X6,X4)
| element(prebool_difference(X4,X5,X6),X4) ),
inference(variable_rename,[status(thm)],[158]) ).
cnf(160,plain,
( element(prebool_difference(X1,X2,X3),X1)
| empty(X1)
| ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[159]) ).
fof(171,plain,
! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
inference(variable_rename,[status(thm)],[34]) ).
cnf(172,plain,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(195,negated_conjecture,
~ element(set_difference(esk7_0,set_difference(esk7_0,esk8_0)),esk9_0),
inference(rw,[status(thm)],[153,172,theory(equality)]),
[unfolding] ).
cnf(278,plain,
( element(set_difference(X2,X3),X1)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
inference(spm,[status(thm)],[160,66,theory(equality)]) ).
cnf(416,negated_conjecture,
( element(set_difference(X1,X2),esk9_0)
| empty(esk9_0)
| ~ element(X2,esk9_0)
| ~ element(X1,esk9_0) ),
inference(spm,[status(thm)],[278,156,theory(equality)]) ).
cnf(418,negated_conjecture,
( element(set_difference(X1,X2),esk9_0)
| ~ element(X2,esk9_0)
| ~ element(X1,esk9_0) ),
inference(sr,[status(thm)],[416,157,theory(equality)]) ).
cnf(425,negated_conjecture,
( ~ element(set_difference(esk7_0,esk8_0),esk9_0)
| ~ element(esk7_0,esk9_0) ),
inference(spm,[status(thm)],[195,418,theory(equality)]) ).
cnf(427,negated_conjecture,
( ~ element(set_difference(esk7_0,esk8_0),esk9_0)
| $false ),
inference(rw,[status(thm)],[425,155,theory(equality)]) ).
cnf(428,negated_conjecture,
~ element(set_difference(esk7_0,esk8_0),esk9_0),
inference(cn,[status(thm)],[427,theory(equality)]) ).
cnf(441,negated_conjecture,
( ~ element(esk8_0,esk9_0)
| ~ element(esk7_0,esk9_0) ),
inference(spm,[status(thm)],[428,418,theory(equality)]) ).
cnf(442,negated_conjecture,
( $false
| ~ element(esk7_0,esk9_0) ),
inference(rw,[status(thm)],[441,154,theory(equality)]) ).
cnf(443,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[442,155,theory(equality)]) ).
cnf(444,negated_conjecture,
$false,
inference(cn,[status(thm)],[443,theory(equality)]) ).
cnf(445,negated_conjecture,
$false,
444,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU102+1.p
% --creating new selector for []
% -running prover on /tmp/tmpyMxKBx/sel_SEU102+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU102+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU102+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU102+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
%
%------------------------------------------------------------------------------