%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC151+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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 10:23:53 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 6 unt; 0 def)
% Number of atoms : 54 ( 13 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 57 ( 15 ~; 9 |; 21 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(23,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ totalorderP(X2)
| totalorderP(X4) ) ) ) ) ),
file('/tmp/tmpJW96WS/sel_SWC151+1.p_1',co1) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ totalorderP(X2)
| totalorderP(X4) ) ) ) ) ),
inference(assume_negation,[status(cth)],[23]) ).
fof(25,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ totalorderP(X2)
| totalorderP(X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[24,theory(equality)]) ).
fof(123,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& totalorderP(X2)
& ~ totalorderP(X4) ) ) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(124,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& totalorderP(X6)
& ~ totalorderP(X8) ) ) ) ),
inference(variable_rename,[status(thm)],[123]) ).
fof(125,negated_conjecture,
( ssList(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& esk11_0 = esk13_0
& esk10_0 = esk12_0
& totalorderP(esk11_0)
& ~ totalorderP(esk13_0) ),
inference(skolemize,[status(esa)],[124]) ).
cnf(126,negated_conjecture,
~ totalorderP(esk13_0),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(127,negated_conjecture,
totalorderP(esk11_0),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(129,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[125]) ).
cnf(137,negated_conjecture,
totalorderP(esk13_0),
inference(rw,[status(thm)],[127,129,theory(equality)]) ).
cnf(267,negated_conjecture,
$false,
inference(sr,[status(thm)],[137,126,theory(equality)]) ).
cnf(268,negated_conjecture,
$false,
267,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC151+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpJW96WS/sel_SWC151+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC151+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC151+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC151+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
%
%------------------------------------------------------------------------------