%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV413+1 : TPTP v5.0.0. Released v3.3.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 12:40:24 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 54 ( 20 ~; 12 |; 19 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 40 ( 0 sgn 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,conjecture,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& less_than(X4,X3) )
=> ? [X5] :
( pair_in_list(update_slb(X1,X4),X2,X5)
& less_than(X4,X5) ) ),
file('/tmp/tmp-owzGU/sel_SWV413+1.p_1',l49_co) ).
fof(13,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/tmp-owzGU/sel_SWV413+1.p_1',l49_li3637) ).
fof(14,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& less_than(X4,X3) )
=> ? [X5] :
( pair_in_list(update_slb(X1,X4),X2,X5)
& less_than(X4,X5) ) ),
inference(assume_negation,[status(cth)],[12]) ).
fof(56,negated_conjecture,
? [X1,X2,X3,X4] :
( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& less_than(X4,X3)
& ! [X5] :
( ~ pair_in_list(update_slb(X1,X4),X2,X5)
| ~ less_than(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(57,negated_conjecture,
? [X6,X7,X8,X9] :
( pair_in_list(X6,X7,X8)
& strictly_less_than(X7,X9)
& less_than(X9,X8)
& ! [X10] :
( ~ pair_in_list(update_slb(X6,X9),X7,X10)
| ~ less_than(X9,X10) ) ),
inference(variable_rename,[status(thm)],[56]) ).
fof(58,negated_conjecture,
( pair_in_list(esk1_0,esk2_0,esk3_0)
& strictly_less_than(esk2_0,esk4_0)
& less_than(esk4_0,esk3_0)
& ! [X10] :
( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X10)
| ~ less_than(esk4_0,X10) ) ),
inference(skolemize,[status(esa)],[57]) ).
fof(59,negated_conjecture,
! [X10] :
( ( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X10)
| ~ less_than(esk4_0,X10) )
& pair_in_list(esk1_0,esk2_0,esk3_0)
& strictly_less_than(esk2_0,esk4_0)
& less_than(esk4_0,esk3_0) ),
inference(shift_quantors,[status(thm)],[58]) ).
cnf(60,negated_conjecture,
less_than(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[59]) ).
cnf(62,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[59]) ).
cnf(63,negated_conjecture,
( ~ less_than(esk4_0,X1)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[59]) ).
fof(64,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)],[13]) ).
fof(65,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)],[64]) ).
cnf(66,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)],[65]) ).
cnf(81,plain,
( ~ less_than(esk4_0,X1)
| ~ pair_in_list(esk1_0,esk2_0,X1) ),
inference(spm,[status(thm)],[63,66,theory(equality)]) ).
cnf(106,negated_conjecture,
~ less_than(esk4_0,esk3_0),
inference(spm,[status(thm)],[81,62,theory(equality)]) ).
cnf(107,negated_conjecture,
$false,
inference(rw,[status(thm)],[106,60,theory(equality)]) ).
cnf(108,negated_conjecture,
$false,
inference(cn,[status(thm)],[107,theory(equality)]) ).
cnf(109,negated_conjecture,
$false,
108,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV413+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax]
% -running prover on /tmp/tmp-owzGU/sel_SWV413+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV413+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV413+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV413+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
%
%------------------------------------------------------------------------------