TSTP Solution File: SWV134+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV134+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:17:20 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 76 ( 19 ~; 10 |; 42 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/tmp/tmp0COhCA/sel_SWV134+1.p_1',transitivity_leq) ).
fof(5,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/tmp/tmp0COhCA/sel_SWV134+1.p_1',leq_gt1) ).
fof(36,axiom,
gt(n2,n0),
file('/tmp/tmp0COhCA/sel_SWV134+1.p_1',gt_2_0) ).
fof(54,conjecture,
( ( ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) )
=> leq(n0,pv1325) ),
file('/tmp/tmp0COhCA/sel_SWV134+1.p_1',gauss_array_0004) ).
fof(57,negated_conjecture,
~ ( ( ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) )
=> leq(n0,pv1325) ),
inference(assume_negation,[status(cth)],[54]) ).
fof(59,negated_conjecture,
~ ( ( ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) )
=> leq(n0,pv1325) ),
inference(fof_simplification,[status(thm)],[57,theory(equality)]) ).
fof(65,plain,
! [X1,X2,X3] :
( ~ leq(X1,X2)
| ~ leq(X2,X3)
| leq(X1,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(66,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[65]) ).
cnf(67,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(71,plain,
! [X1,X2] :
( ~ gt(X2,X1)
| leq(X1,X2) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(72,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[71]) ).
cnf(73,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(127,plain,
gt(n2,n0),
inference(split_conjunct,[status(thm)],[36]) ).
fof(157,negated_conjecture,
( ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& ~ leq(n0,pv1325) ),
inference(fof_nnf,[status(thm)],[59]) ).
cnf(158,negated_conjecture,
~ leq(n0,pv1325),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(165,negated_conjecture,
leq(n2,pv1325),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(196,plain,
leq(n0,n2),
inference(spm,[status(thm)],[73,127,theory(equality)]) ).
cnf(218,negated_conjecture,
( leq(X1,pv1325)
| ~ leq(X1,n2) ),
inference(spm,[status(thm)],[67,165,theory(equality)]) ).
cnf(552,negated_conjecture,
~ leq(n0,n2),
inference(spm,[status(thm)],[158,218,theory(equality)]) ).
cnf(559,negated_conjecture,
$false,
inference(rw,[status(thm)],[552,196,theory(equality)]) ).
cnf(560,negated_conjecture,
$false,
inference(cn,[status(thm)],[559,theory(equality)]) ).
cnf(561,negated_conjecture,
$false,
560,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV134+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmp0COhCA/sel_SWV134+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV134+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV134+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV134+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
%
%------------------------------------------------------------------------------