TSTP Solution File: SWV389+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV389+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:52 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 48 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 48 ( 24 ~; 13 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
file('/tmp/tmpJlhmeG/sel_SWV389+1.p_1',ax52) ).
fof(28,axiom,
! [X1,X2,X3] :
( ( check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
& ok(removemin_cpq_eff(triple(X1,X2,X3))) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/tmp/tmpJlhmeG/sel_SWV389+1.p_1',l25_l40) ).
fof(29,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ ok(removemin_cpq_eff(triple(X1,X2,X3))) ) ),
file('/tmp/tmpJlhmeG/sel_SWV389+1.p_1',l25_co) ).
fof(30,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ ok(removemin_cpq_eff(triple(X1,X2,X3))) ) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(36,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ ok(removemin_cpq_eff(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[30,theory(equality)]) ).
fof(78,plain,
! [X2] : removemin_cpq_eff(X2) = remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)),
inference(variable_rename,[status(thm)],[15]) ).
cnf(79,plain,
removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
inference(split_conjunct,[status(thm)],[78]) ).
fof(120,plain,
! [X1,X2,X3] :
( ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ ok(removemin_cpq_eff(triple(X1,X2,X3)))
| check_cpq(triple(X1,X2,X3)) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(121,plain,
! [X4,X5,X6] :
( ~ check_cpq(removemin_cpq_eff(triple(X4,X5,X6)))
| ~ ok(removemin_cpq_eff(triple(X4,X5,X6)))
| check_cpq(triple(X4,X5,X6)) ),
inference(variable_rename,[status(thm)],[120]) ).
cnf(122,plain,
( check_cpq(triple(X1,X2,X3))
| ~ ok(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[121]) ).
fof(123,negated_conjecture,
? [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
& check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
& ok(removemin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(124,negated_conjecture,
? [X4,X5,X6] :
( ~ check_cpq(triple(X4,X5,X6))
& check_cpq(removemin_cpq_eff(triple(X4,X5,X6)))
& ok(removemin_cpq_eff(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[123]) ).
fof(125,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
& check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[124]) ).
cnf(126,negated_conjecture,
ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(127,negated_conjecture,
check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(128,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(129,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
inference(rw,[status(thm)],[126,79,theory(equality)]),
[unfolding] ).
cnf(130,negated_conjecture,
check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
inference(rw,[status(thm)],[127,79,theory(equality)]),
[unfolding] ).
cnf(132,plain,
( check_cpq(triple(X1,X2,X3))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[122,79,theory(equality)]),79,theory(equality)]),
[unfolding] ).
cnf(181,negated_conjecture,
( check_cpq(triple(esk1_0,esk2_0,esk3_0))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))) ),
inference(spm,[status(thm)],[132,129,theory(equality)]) ).
cnf(186,negated_conjecture,
( check_cpq(triple(esk1_0,esk2_0,esk3_0))
| $false ),
inference(rw,[status(thm)],[181,130,theory(equality)]) ).
cnf(187,negated_conjecture,
check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[186,theory(equality)]) ).
cnf(188,negated_conjecture,
$false,
inference(sr,[status(thm)],[187,128,theory(equality)]) ).
cnf(189,negated_conjecture,
$false,
188,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV389+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmpJlhmeG/sel_SWV389+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV389+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV389+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV389+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
%
%------------------------------------------------------------------------------