TSTP Solution File: SWV417+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV417+1 : TPTP v5.0.0. Released v3.3.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 12:41:20 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 5 unt; 0 def)
% Number of atoms : 86 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 99 ( 42 ~; 32 |; 18 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 54 ( 0 sgn 33 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> findmin_pq_res(X1,X2) = X2 ),
file('/tmp/tmp10cyon/sel_SWV417+1.p_1',ax14) ).
fof(26,axiom,
! [X1,X2] :
( pi_sharp_find_min(X1,X2)
<=> ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) ),
file('/tmp/tmp10cyon/sel_SWV417+1.p_1',ax58) ).
fof(30,conjecture,
! [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
=> ( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> ? [X4] :
( pi_sharp_find_min(i(triple(X1,X2,X3)),X4)
& findmin_cpq_res(triple(X1,X2,X3)) = findmin_pq_res(i(triple(X1,X2,X3)),X4) ) ) ),
file('/tmp/tmp10cyon/sel_SWV417+1.p_1',co4) ).
fof(31,axiom,
! [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/tmp10cyon/sel_SWV417+1.p_1',main4_l7) ).
fof(32,negated_conjecture,
~ ! [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
=> ( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> ? [X4] :
( pi_sharp_find_min(i(triple(X1,X2,X3)),X4)
& findmin_cpq_res(triple(X1,X2,X3)) = findmin_pq_res(i(triple(X1,X2,X3)),X4) ) ) ),
inference(assume_negation,[status(cth)],[30]) ).
fof(94,plain,
! [X1,X2] :
( ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| findmin_pq_res(X1,X2) = X2 ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(95,plain,
! [X3,X4] :
( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| findmin_pq_res(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[94]) ).
cnf(96,plain,
( findmin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[95]) ).
fof(129,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)],[26]) ).
fof(130,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)],[129]) ).
fof(131,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)],[130]) ).
cnf(133,plain,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
inference(split_conjunct,[status(thm)],[131]) ).
cnf(134,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
inference(split_conjunct,[status(thm)],[131]) ).
fof(142,negated_conjecture,
? [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
& phi(findmin_cpq_eff(triple(X1,X2,X3)))
& ! [X4] :
( ~ pi_sharp_find_min(i(triple(X1,X2,X3)),X4)
| findmin_cpq_res(triple(X1,X2,X3)) != findmin_pq_res(i(triple(X1,X2,X3)),X4) ) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(143,negated_conjecture,
? [X5,X6,X7] :
( pi_find_min(triple(X5,X6,X7))
& phi(findmin_cpq_eff(triple(X5,X6,X7)))
& ! [X8] :
( ~ pi_sharp_find_min(i(triple(X5,X6,X7)),X8)
| findmin_cpq_res(triple(X5,X6,X7)) != findmin_pq_res(i(triple(X5,X6,X7)),X8) ) ),
inference(variable_rename,[status(thm)],[142]) ).
fof(144,negated_conjecture,
( pi_find_min(triple(esk4_0,esk5_0,esk6_0))
& phi(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0)))
& ! [X8] :
( ~ pi_sharp_find_min(i(triple(esk4_0,esk5_0,esk6_0)),X8)
| findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)) != findmin_pq_res(i(triple(esk4_0,esk5_0,esk6_0)),X8) ) ),
inference(skolemize,[status(esa)],[143]) ).
fof(145,negated_conjecture,
! [X8] :
( ( ~ pi_sharp_find_min(i(triple(esk4_0,esk5_0,esk6_0)),X8)
| findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)) != findmin_pq_res(i(triple(esk4_0,esk5_0,esk6_0)),X8) )
& phi(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0)))
& pi_find_min(triple(esk4_0,esk5_0,esk6_0)) ),
inference(shift_quantors,[status(thm)],[144]) ).
cnf(147,negated_conjecture,
phi(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0))),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(148,negated_conjecture,
( findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)) != findmin_pq_res(i(triple(esk4_0,esk5_0,esk6_0)),X1)
| ~ pi_sharp_find_min(i(triple(esk4_0,esk5_0,esk6_0)),X1) ),
inference(split_conjunct,[status(thm)],[145]) ).
fof(149,plain,
! [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(150,plain,
! [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)],[149]) ).
cnf(151,plain,
( pi_sharp_find_min(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)],[150]) ).
cnf(186,negated_conjecture,
( X1 != findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0))
| ~ pi_sharp_find_min(i(triple(esk4_0,esk5_0,esk6_0)),X1)
| ~ issmallestelement_pq(i(triple(esk4_0,esk5_0,esk6_0)),X1)
| ~ contains_pq(i(triple(esk4_0,esk5_0,esk6_0)),X1) ),
inference(spm,[status(thm)],[148,96,theory(equality)]) ).
cnf(224,negated_conjecture,
( X1 != findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0))
| ~ pi_sharp_find_min(i(triple(esk4_0,esk5_0,esk6_0)),X1)
| ~ issmallestelement_pq(i(triple(esk4_0,esk5_0,esk6_0)),X1) ),
inference(csr,[status(thm)],[186,134]) ).
cnf(225,negated_conjecture,
( X1 != findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0))
| ~ pi_sharp_find_min(i(triple(esk4_0,esk5_0,esk6_0)),X1) ),
inference(csr,[status(thm)],[224,133]) ).
cnf(227,plain,
~ phi(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0))),
inference(spm,[status(thm)],[225,151,theory(equality)]) ).
cnf(230,plain,
$false,
inference(rw,[status(thm)],[227,147,theory(equality)]) ).
cnf(231,plain,
$false,
inference(cn,[status(thm)],[230,theory(equality)]) ).
cnf(232,plain,
$false,
231,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV417+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/tmp10cyon/sel_SWV417+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV417+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV417+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV417+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
%
%------------------------------------------------------------------------------