%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV385+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:34:13 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 81 ( 44 ~; 24 |; 6 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn 33 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,conjecture,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
file('/tmp/tmpIzUuqE/sel_SWV385+1.p_1',l21_co) ).
fof(16,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
file('/tmp/tmpIzUuqE/sel_SWV385+1.p_1',l21_li1316) ).
fof(17,axiom,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
file('/tmp/tmpIzUuqE/sel_SWV385+1.p_1',l21_li2225) ).
fof(18,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(assume_negation,[status(cth)],[15]) ).
fof(22,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(23,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[16,theory(equality)]) ).
fof(24,plain,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(73,negated_conjecture,
? [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
& check_cpq(im_succ_cpq(triple(X1,X2,X3)))
& ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(74,negated_conjecture,
? [X4,X5,X6] :
( ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) )
& check_cpq(im_succ_cpq(triple(X4,X5,X6)))
& ok(im_succ_cpq(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[73]) ).
fof(75,negated_conjecture,
( ( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
| ~ ok(triple(esk1_0,esk2_0,esk3_0)) )
& check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0)))
& ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[74]) ).
cnf(76,negated_conjecture,
ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(77,negated_conjecture,
check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(78,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
| ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[75]) ).
fof(79,plain,
! [X1,X2,X3] :
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(80,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| ~ ok(im_succ_cpq(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[79]) ).
cnf(81,plain,
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[80]) ).
fof(82,plain,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(83,plain,
! [X4,X5,X6] :
( check_cpq(triple(X4,X5,X6))
| ~ check_cpq(im_succ_cpq(triple(X4,X5,X6)))
| ~ ok(im_succ_cpq(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[82]) ).
cnf(84,plain,
( check_cpq(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[83]) ).
cnf(91,negated_conjecture,
ok(triple(esk1_0,esk2_0,esk3_0)),
inference(spm,[status(thm)],[81,76,theory(equality)]) ).
cnf(92,negated_conjecture,
( check_cpq(triple(esk1_0,esk2_0,esk3_0))
| ~ check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))) ),
inference(spm,[status(thm)],[84,76,theory(equality)]) ).
cnf(93,negated_conjecture,
( check_cpq(triple(esk1_0,esk2_0,esk3_0))
| $false ),
inference(rw,[status(thm)],[92,77,theory(equality)]) ).
cnf(94,negated_conjecture,
check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[93,theory(equality)]) ).
cnf(119,negated_conjecture,
( $false
| ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ),
inference(rw,[status(thm)],[78,91,theory(equality)]) ).
cnf(120,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[119,theory(equality)]) ).
cnf(121,negated_conjecture,
$false,
inference(sr,[status(thm)],[94,120,theory(equality)]) ).
cnf(122,negated_conjecture,
$false,
121,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV385+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmpIzUuqE/sel_SWV385+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV385+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV385+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV385+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
%
%------------------------------------------------------------------------------