TSTP Solution File: SWV371+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV371+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:27:48 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 66 ( 30 ~; 21 |; 10 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 46 ( 0 sgn 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,axiom,
! [X1,X2] :
( pi_sharp_find_min(X1,X2)
<=> ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) ),
file('/tmp/tmp6xf2cC/sel_SWV371+1.p_1',ax58) ).
fof(28,conjecture,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/tmp/tmp6xf2cC/sel_SWV371+1.p_1',l7_co) ).
fof(29,axiom,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/tmp/tmp6xf2cC/sel_SWV371+1.p_1',l7_lX) ).
fof(30,axiom,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/tmp/tmp6xf2cC/sel_SWV371+1.p_1',l7_l8) ).
fof(31,negated_conjecture,
~ ! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[28]) ).
fof(93,plain,
! [X1,X2] :
( ( ~ pi_sharp_find_min(X1,X2)
| ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) )
& ( ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| pi_sharp_find_min(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(94,plain,
! [X3,X4] :
( ( ~ pi_sharp_find_min(X3,X4)
| ( contains_pq(X3,X4)
& issmallestelement_pq(X3,X4) ) )
& ( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| pi_sharp_find_min(X3,X4) ) ),
inference(variable_rename,[status(thm)],[93]) ).
fof(95,plain,
! [X3,X4] :
( ( contains_pq(X3,X4)
| ~ pi_sharp_find_min(X3,X4) )
& ( issmallestelement_pq(X3,X4)
| ~ pi_sharp_find_min(X3,X4) )
& ( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| pi_sharp_find_min(X3,X4) ) ),
inference(distribute,[status(thm)],[94]) ).
cnf(96,plain,
( pi_sharp_find_min(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[95]) ).
fof(132,negated_conjecture,
? [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
& ~ pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(133,negated_conjecture,
? [X4,X5,X6] :
( phi(findmin_cpq_eff(triple(X4,X5,X6)))
& ~ pi_sharp_find_min(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[132]) ).
fof(134,negated_conjecture,
( phi(findmin_cpq_eff(triple(esk3_0,esk4_0,esk5_0)))
& ~ pi_sharp_find_min(i(triple(esk3_0,esk4_0,esk5_0)),findmin_cpq_res(triple(esk3_0,esk4_0,esk5_0))) ),
inference(skolemize,[status(esa)],[133]) ).
cnf(135,negated_conjecture,
~ pi_sharp_find_min(i(triple(esk3_0,esk4_0,esk5_0)),findmin_cpq_res(triple(esk3_0,esk4_0,esk5_0))),
inference(split_conjunct,[status(thm)],[134]) ).
cnf(136,negated_conjecture,
phi(findmin_cpq_eff(triple(esk3_0,esk4_0,esk5_0))),
inference(split_conjunct,[status(thm)],[134]) ).
fof(137,plain,
! [X1,X2,X3] :
( ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
| issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(138,plain,
! [X4,X5,X6] :
( ~ phi(findmin_cpq_eff(triple(X4,X5,X6)))
| issmallestelement_pq(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[137]) ).
cnf(139,plain,
( issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[138]) ).
fof(140,plain,
! [X1,X2,X3] :
( ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
| contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(141,plain,
! [X4,X5,X6] :
( ~ phi(findmin_cpq_eff(triple(X4,X5,X6)))
| contains_pq(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[140]) ).
cnf(142,plain,
( contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(152,negated_conjecture,
( ~ issmallestelement_pq(i(triple(esk3_0,esk4_0,esk5_0)),findmin_cpq_res(triple(esk3_0,esk4_0,esk5_0)))
| ~ contains_pq(i(triple(esk3_0,esk4_0,esk5_0)),findmin_cpq_res(triple(esk3_0,esk4_0,esk5_0))) ),
inference(spm,[status(thm)],[135,96,theory(equality)]) ).
cnf(216,plain,
( ~ contains_pq(i(triple(esk3_0,esk4_0,esk5_0)),findmin_cpq_res(triple(esk3_0,esk4_0,esk5_0)))
| ~ phi(findmin_cpq_eff(triple(esk3_0,esk4_0,esk5_0))) ),
inference(spm,[status(thm)],[152,139,theory(equality)]) ).
cnf(217,plain,
( ~ contains_pq(i(triple(esk3_0,esk4_0,esk5_0)),findmin_cpq_res(triple(esk3_0,esk4_0,esk5_0)))
| $false ),
inference(rw,[status(thm)],[216,136,theory(equality)]) ).
cnf(218,plain,
~ contains_pq(i(triple(esk3_0,esk4_0,esk5_0)),findmin_cpq_res(triple(esk3_0,esk4_0,esk5_0))),
inference(cn,[status(thm)],[217,theory(equality)]) ).
cnf(220,plain,
~ phi(findmin_cpq_eff(triple(esk3_0,esk4_0,esk5_0))),
inference(spm,[status(thm)],[218,142,theory(equality)]) ).
cnf(221,plain,
$false,
inference(rw,[status(thm)],[220,136,theory(equality)]) ).
cnf(222,plain,
$false,
inference(cn,[status(thm)],[221,theory(equality)]) ).
cnf(223,plain,
$false,
222,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV371+1.p
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% -running prover on /tmp/tmp6xf2cC/sel_SWV371+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV371+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV371+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV371+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
%
%------------------------------------------------------------------------------