TSTP Solution File: SWV383+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV383+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:33:42 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 98 ( 44 ~; 31 |; 13 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 72 ( 0 sgn 54 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(20,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
file('/tmp/tmpmdrZvT/sel_SWV383+1.p_1',l19_co) ).
fof(21,axiom,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
file('/tmp/tmpmdrZvT/sel_SWV383+1.p_1',l19_l20) ).
fof(22,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
inference(assume_negation,[status(cth)],[20]) ).
fof(27,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(28,plain,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).
fof(90,negated_conjecture,
? [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
& ? [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
& ok(triple(X4,X5,X6))
& check_cpq(triple(X4,X5,X6)) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(91,negated_conjecture,
? [X7,X8,X9] :
( ~ check_cpq(triple(X7,X8,X9))
& ? [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
& ok(triple(X10,X11,X12))
& check_cpq(triple(X10,X11,X12)) ) ),
inference(variable_rename,[status(thm)],[90]) ).
fof(92,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
& succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))
& ok(triple(esk4_0,esk5_0,esk6_0))
& check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
inference(skolemize,[status(esa)],[91]) ).
cnf(93,negated_conjecture,
check_cpq(triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[92]) ).
cnf(94,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[92]) ).
cnf(95,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[92]) ).
cnf(96,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[92]) ).
fof(97,plain,
! [X1,X2,X3] :
( ( check_cpq(triple(X1,X2,X3))
& ok(triple(X1,X2,X3)) )
| ! [X4,X5,X6] :
( ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(98,plain,
! [X7,X8,X9] :
( ( check_cpq(triple(X7,X8,X9))
& ok(triple(X7,X8,X9)) )
| ! [X10,X11,X12] :
( ~ succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
| ~ ok(triple(X10,X11,X12))
| ~ check_cpq(triple(X10,X11,X12)) ) ),
inference(variable_rename,[status(thm)],[97]) ).
fof(99,plain,
! [X7,X8,X9,X10,X11,X12] :
( ~ succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
| ~ ok(triple(X10,X11,X12))
| ~ check_cpq(triple(X10,X11,X12))
| ( check_cpq(triple(X7,X8,X9))
& ok(triple(X7,X8,X9)) ) ),
inference(shift_quantors,[status(thm)],[98]) ).
fof(100,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( check_cpq(triple(X7,X8,X9))
| ~ succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
| ~ ok(triple(X10,X11,X12))
| ~ check_cpq(triple(X10,X11,X12)) )
& ( ok(triple(X7,X8,X9))
| ~ succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
| ~ ok(triple(X10,X11,X12))
| ~ check_cpq(triple(X10,X11,X12)) ) ),
inference(distribute,[status(thm)],[99]) ).
cnf(102,plain,
( check_cpq(triple(X4,X5,X6))
| ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3))
| ~ succ_cpq(triple(X4,X5,X6),triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[100]) ).
cnf(132,negated_conjecture,
( check_cpq(triple(esk1_0,esk2_0,esk3_0))
| ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[102,95,theory(equality)]) ).
cnf(133,negated_conjecture,
( check_cpq(triple(esk1_0,esk2_0,esk3_0))
| $false
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
inference(rw,[status(thm)],[132,94,theory(equality)]) ).
cnf(134,negated_conjecture,
( check_cpq(triple(esk1_0,esk2_0,esk3_0))
| $false
| $false ),
inference(rw,[status(thm)],[133,93,theory(equality)]) ).
cnf(135,negated_conjecture,
check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[134,theory(equality)]) ).
cnf(136,negated_conjecture,
$false,
inference(sr,[status(thm)],[135,96,theory(equality)]) ).
cnf(137,negated_conjecture,
$false,
136,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV383+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmpmdrZvT/sel_SWV383+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV383+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV383+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV383+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
%
%------------------------------------------------------------------------------