%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV399+1 : TPTP v5.0.0. Released v3.3.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 12:38:10 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 6 unt; 0 def)
% Number of atoms : 125 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 134 ( 54 ~; 50 |; 23 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 59 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
file('/tmp/tmpaPlHQ-/sel_SWV399+1.p_1',transitivity) ).
fof(6,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/tmp/tmpaPlHQ-/sel_SWV399+1.p_1',totality) ).
fof(7,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/tmp/tmpaPlHQ-/sel_SWV399+1.p_1',stricly_smaller_definition) ).
fof(12,axiom,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) ),
file('/tmp/tmpaPlHQ-/sel_SWV399+1.p_1',l35_li3839) ).
fof(13,conjecture,
! [X1] :
( ? [X2,X3] :
( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X3) )
=> ! [X4] :
? [X5,X6] :
( pair_in_list(update_slb(X1,X4),X5,X6)
& strictly_less_than(X5,X6) ) ),
file('/tmp/tmpaPlHQ-/sel_SWV399+1.p_1',l35_co) ).
fof(14,axiom,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& less_than(X4,X3) )
=> pair_in_list(update_slb(X1,X4),X2,X3) ),
file('/tmp/tmpaPlHQ-/sel_SWV399+1.p_1',l35_li3637) ).
fof(15,negated_conjecture,
~ ! [X1] :
( ? [X2,X3] :
( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X3) )
=> ! [X4] :
? [X5,X6] :
( pair_in_list(update_slb(X1,X4),X5,X6)
& strictly_less_than(X5,X6) ) ),
inference(assume_negation,[status(cth)],[13]) ).
fof(16,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(19,plain,
! [X1,X2,X3] :
( ~ less_than(X1,X2)
| ~ less_than(X2,X3)
| less_than(X1,X3) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(20,plain,
! [X4,X5,X6] :
( ~ less_than(X4,X5)
| ~ less_than(X5,X6)
| less_than(X4,X6) ),
inference(variable_rename,[status(thm)],[19]) ).
cnf(21,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(32,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[6]) ).
cnf(33,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[32]) ).
fof(34,plain,
! [X1,X2] :
( ( ~ strictly_less_than(X1,X2)
| ( less_than(X1,X2)
& ~ less_than(X2,X1) ) )
& ( ~ less_than(X1,X2)
| less_than(X2,X1)
| strictly_less_than(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(35,plain,
! [X3,X4] :
( ( ~ strictly_less_than(X3,X4)
| ( less_than(X3,X4)
& ~ less_than(X4,X3) ) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(variable_rename,[status(thm)],[34]) ).
fof(36,plain,
! [X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(distribute,[status(thm)],[35]) ).
cnf(37,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(39,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(57,plain,
! [X1,X2,X3,X4] :
( ~ pair_in_list(X1,X2,X3)
| ~ strictly_less_than(X3,X4)
| pair_in_list(update_slb(X1,X4),X2,X4) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(58,plain,
! [X5,X6,X7,X8] :
( ~ pair_in_list(X5,X6,X7)
| ~ strictly_less_than(X7,X8)
| pair_in_list(update_slb(X5,X8),X6,X8) ),
inference(variable_rename,[status(thm)],[57]) ).
cnf(59,plain,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ pair_in_list(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[58]) ).
fof(60,negated_conjecture,
? [X1] :
( ? [X2,X3] :
( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X3) )
& ? [X4] :
! [X5,X6] :
( ~ pair_in_list(update_slb(X1,X4),X5,X6)
| ~ strictly_less_than(X5,X6) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(61,negated_conjecture,
? [X7] :
( ? [X8,X9] :
( pair_in_list(X7,X8,X9)
& strictly_less_than(X8,X9) )
& ? [X10] :
! [X11,X12] :
( ~ pair_in_list(update_slb(X7,X10),X11,X12)
| ~ strictly_less_than(X11,X12) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,negated_conjecture,
( pair_in_list(esk1_0,esk2_0,esk3_0)
& strictly_less_than(esk2_0,esk3_0)
& ! [X11,X12] :
( ~ pair_in_list(update_slb(esk1_0,esk4_0),X11,X12)
| ~ strictly_less_than(X11,X12) ) ),
inference(skolemize,[status(esa)],[61]) ).
fof(63,negated_conjecture,
! [X11,X12] :
( ( ~ pair_in_list(update_slb(esk1_0,esk4_0),X11,X12)
| ~ strictly_less_than(X11,X12) )
& pair_in_list(esk1_0,esk2_0,esk3_0)
& strictly_less_than(esk2_0,esk3_0) ),
inference(shift_quantors,[status(thm)],[62]) ).
cnf(64,negated_conjecture,
strictly_less_than(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(65,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(66,negated_conjecture,
( ~ strictly_less_than(X1,X2)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),X1,X2) ),
inference(split_conjunct,[status(thm)],[63]) ).
fof(67,plain,
! [X1,X2,X3,X4] :
( ~ pair_in_list(X1,X2,X3)
| ~ less_than(X4,X3)
| pair_in_list(update_slb(X1,X4),X2,X3) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(68,plain,
! [X5,X6,X7,X8] :
( ~ pair_in_list(X5,X6,X7)
| ~ less_than(X8,X7)
| pair_in_list(update_slb(X5,X8),X6,X7) ),
inference(variable_rename,[status(thm)],[67]) ).
cnf(69,plain,
( pair_in_list(update_slb(X1,X2),X3,X4)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[68]) ).
cnf(70,negated_conjecture,
less_than(esk2_0,esk3_0),
inference(spm,[status(thm)],[39,64,theory(equality)]) ).
cnf(76,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[37,33]) ).
cnf(85,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk3_0,X1) ),
inference(spm,[status(thm)],[59,65,theory(equality)]) ).
cnf(89,plain,
( ~ strictly_less_than(X1,X2)
| ~ pair_in_list(esk1_0,X1,X2)
| ~ less_than(esk4_0,X2) ),
inference(spm,[status(thm)],[66,69,theory(equality)]) ).
cnf(109,negated_conjecture,
( less_than(X1,esk3_0)
| ~ less_than(X1,esk2_0) ),
inference(spm,[status(thm)],[21,70,theory(equality)]) ).
cnf(115,negated_conjecture,
( ~ strictly_less_than(esk2_0,esk4_0)
| ~ strictly_less_than(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[66,85,theory(equality)]) ).
cnf(117,negated_conjecture,
( less_than(esk4_0,esk3_0)
| ~ strictly_less_than(esk2_0,esk4_0) ),
inference(spm,[status(thm)],[115,76,theory(equality)]) ).
cnf(118,negated_conjecture,
( less_than(esk4_0,esk3_0)
| less_than(esk4_0,esk2_0) ),
inference(spm,[status(thm)],[117,76,theory(equality)]) ).
cnf(119,negated_conjecture,
less_than(esk4_0,esk3_0),
inference(csr,[status(thm)],[118,109]) ).
cnf(131,negated_conjecture,
( ~ pair_in_list(esk1_0,esk2_0,esk3_0)
| ~ less_than(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[89,64,theory(equality)]) ).
cnf(133,negated_conjecture,
( $false
| ~ less_than(esk4_0,esk3_0) ),
inference(rw,[status(thm)],[131,65,theory(equality)]) ).
cnf(134,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[133,119,theory(equality)]) ).
cnf(135,negated_conjecture,
$false,
inference(cn,[status(thm)],[134,theory(equality)]) ).
cnf(136,negated_conjecture,
$false,
135,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV399+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax]
% -running prover on /tmp/tmpaPlHQ-/sel_SWV399+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV399+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV399+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV399+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
%
%------------------------------------------------------------------------------