TSTP Solution File: SET797+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET797+4 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 03:40:02 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 6 unt; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 135 ( 44 ~; 42 |; 39 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 83 ( 0 sgn 52 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpYkJEF1/sel_SET797+4.p_1',subset) ).
fof(3,axiom,
! [X4,X5,X8] :
( upper_bound(X8,X4,X5)
<=> ! [X3] :
( member(X3,X5)
=> apply(X4,X3,X8) ) ),
file('/tmp/tmpYkJEF1/sel_SET797+4.p_1',upper_bound) ).
fof(4,conjecture,
! [X4,X5] :
( order(X4,X5)
=> ! [X3,X6] :
( ( subset(X3,X5)
& subset(X6,X5)
& subset(X3,X6) )
=> ! [X8] :
( upper_bound(X8,X4,X6)
=> upper_bound(X8,X4,X3) ) ) ),
file('/tmp/tmpYkJEF1/sel_SET797+4.p_1',thIV9) ).
fof(5,negated_conjecture,
~ ! [X4,X5] :
( order(X4,X5)
=> ! [X3,X6] :
( ( subset(X3,X5)
& subset(X6,X5)
& subset(X3,X6) )
=> ! [X8] :
( upper_bound(X8,X4,X6)
=> upper_bound(X8,X4,X3) ) ) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(8,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ member(X3,X1)
| member(X3,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(9,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ? [X7] :
( member(X7,X4)
& ~ member(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[8]) ).
fof(10,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[9]) ).
fof(11,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[10]) ).
fof(12,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( member(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[11]) ).
cnf(15,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(20,plain,
! [X4,X5,X8] :
( ( ~ upper_bound(X8,X4,X5)
| ! [X3] :
( ~ member(X3,X5)
| apply(X4,X3,X8) ) )
& ( ? [X3] :
( member(X3,X5)
& ~ apply(X4,X3,X8) )
| upper_bound(X8,X4,X5) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(21,plain,
! [X9,X10,X11] :
( ( ~ upper_bound(X11,X9,X10)
| ! [X12] :
( ~ member(X12,X10)
| apply(X9,X12,X11) ) )
& ( ? [X13] :
( member(X13,X10)
& ~ apply(X9,X13,X11) )
| upper_bound(X11,X9,X10) ) ),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,plain,
! [X9,X10,X11] :
( ( ~ upper_bound(X11,X9,X10)
| ! [X12] :
( ~ member(X12,X10)
| apply(X9,X12,X11) ) )
& ( ( member(esk2_3(X9,X10,X11),X10)
& ~ apply(X9,esk2_3(X9,X10,X11),X11) )
| upper_bound(X11,X9,X10) ) ),
inference(skolemize,[status(esa)],[21]) ).
fof(23,plain,
! [X9,X10,X11,X12] :
( ( ~ member(X12,X10)
| apply(X9,X12,X11)
| ~ upper_bound(X11,X9,X10) )
& ( ( member(esk2_3(X9,X10,X11),X10)
& ~ apply(X9,esk2_3(X9,X10,X11),X11) )
| upper_bound(X11,X9,X10) ) ),
inference(shift_quantors,[status(thm)],[22]) ).
fof(24,plain,
! [X9,X10,X11,X12] :
( ( ~ member(X12,X10)
| apply(X9,X12,X11)
| ~ upper_bound(X11,X9,X10) )
& ( member(esk2_3(X9,X10,X11),X10)
| upper_bound(X11,X9,X10) )
& ( ~ apply(X9,esk2_3(X9,X10,X11),X11)
| upper_bound(X11,X9,X10) ) ),
inference(distribute,[status(thm)],[23]) ).
cnf(25,plain,
( upper_bound(X1,X2,X3)
| ~ apply(X2,esk2_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(26,plain,
( upper_bound(X1,X2,X3)
| member(esk2_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(27,plain,
( apply(X2,X4,X1)
| ~ upper_bound(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(28,negated_conjecture,
? [X4,X5] :
( order(X4,X5)
& ? [X3,X6] :
( subset(X3,X5)
& subset(X6,X5)
& subset(X3,X6)
& ? [X8] :
( upper_bound(X8,X4,X6)
& ~ upper_bound(X8,X4,X3) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(29,negated_conjecture,
? [X9,X10] :
( order(X9,X10)
& ? [X11,X12] :
( subset(X11,X10)
& subset(X12,X10)
& subset(X11,X12)
& ? [X13] :
( upper_bound(X13,X9,X12)
& ~ upper_bound(X13,X9,X11) ) ) ),
inference(variable_rename,[status(thm)],[28]) ).
fof(30,negated_conjecture,
( order(esk3_0,esk4_0)
& subset(esk5_0,esk4_0)
& subset(esk6_0,esk4_0)
& subset(esk5_0,esk6_0)
& upper_bound(esk7_0,esk3_0,esk6_0)
& ~ upper_bound(esk7_0,esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[29]) ).
cnf(31,negated_conjecture,
~ upper_bound(esk7_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(32,negated_conjecture,
upper_bound(esk7_0,esk3_0,esk6_0),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(33,negated_conjecture,
subset(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(109,negated_conjecture,
( member(X1,esk6_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[15,33,theory(equality)]) ).
cnf(111,negated_conjecture,
( apply(esk3_0,X1,esk7_0)
| ~ member(X1,esk6_0) ),
inference(spm,[status(thm)],[27,32,theory(equality)]) ).
cnf(206,negated_conjecture,
( upper_bound(esk7_0,esk3_0,X1)
| ~ member(esk2_3(esk3_0,X1,esk7_0),esk6_0) ),
inference(spm,[status(thm)],[25,111,theory(equality)]) ).
cnf(222,negated_conjecture,
( upper_bound(esk7_0,esk3_0,X1)
| ~ member(esk2_3(esk3_0,X1,esk7_0),esk5_0) ),
inference(spm,[status(thm)],[206,109,theory(equality)]) ).
cnf(224,negated_conjecture,
upper_bound(esk7_0,esk3_0,esk5_0),
inference(spm,[status(thm)],[222,26,theory(equality)]) ).
cnf(225,negated_conjecture,
$false,
inference(sr,[status(thm)],[224,31,theory(equality)]) ).
cnf(226,negated_conjecture,
$false,
225,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET797+4.p
% --creating new selector for [SET006+0.ax, SET006+3.ax]
% -running prover on /tmp/tmpYkJEF1/sel_SET797+4.p_1 with time limit 29
% -prover status Theorem
% Problem SET797+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET797+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET797+4.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
%
%------------------------------------------------------------------------------