TSTP Solution File: SWV133+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWV133+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu May 9 17:44:17 EDT 2024
% Result : Theorem 38.40s 38.61s
% Output : Refutation 38.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 71 ( 18 ~; 10 |; 38 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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(gauss_array_0003,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(n0,pv1325) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0003) ).
fof(c66,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(n0,pv1325) ),
inference(assume_negation,[status(cth)],[gauss_array_0003]) ).
fof(c67,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(n0,pv1325) ),
inference(fof_simplification,[status(thm)],[c66]) ).
fof(c68,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(n0,pv1325) ),
inference(fof_nnf,[status(thm)],[c67]) ).
cnf(c79,negated_conjecture,
~ leq(n0,pv1325),
inference(split_conjunct,[status(thm)],[c68]) ).
fof(gt_2_0,axiom,
gt(n2,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_2_0) ).
cnf(c55,plain,
gt(n2,n0),
inference(split_conjunct,[status(thm)],[gt_2_0]) ).
fof(leq_gt1,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(c438,plain,
! [X,Y] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(fof_nnf,[status(thm)],[leq_gt1]) ).
fof(c439,plain,
! [X160,X161] :
( ~ gt(X161,X160)
| leq(X160,X161) ),
inference(variable_rename,[status(thm)],[c438]) ).
cnf(c440,plain,
( ~ gt(X213,X212)
| leq(X212,X213) ),
inference(split_conjunct,[status(thm)],[c439]) ).
cnf(c532,plain,
leq(n0,n2),
inference(resolution,[status(thm)],[c440,c55]) ).
cnf(c73,negated_conjecture,
leq(n2,pv1325),
inference(split_conjunct,[status(thm)],[c68]) ).
fof(transitivity_leq,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(c453,plain,
! [X,Y,Z] :
( ~ leq(X,Y)
| ~ leq(Y,Z)
| leq(X,Z) ),
inference(fof_nnf,[status(thm)],[transitivity_leq]) ).
fof(c454,plain,
! [X170,X171,X172] :
( ~ leq(X170,X171)
| ~ leq(X171,X172)
| leq(X170,X172) ),
inference(variable_rename,[status(thm)],[c453]) ).
cnf(c455,plain,
( ~ leq(X2211,X2210)
| ~ leq(X2210,X2209)
| leq(X2211,X2209) ),
inference(split_conjunct,[status(thm)],[c454]) ).
cnf(c31224,plain,
( ~ leq(X2738,n2)
| leq(X2738,pv1325) ),
inference(resolution,[status(thm)],[c455,c73]) ).
cnf(c49878,plain,
leq(n0,pv1325),
inference(resolution,[status(thm)],[c31224,c532]) ).
cnf(c50254,plain,
$false,
inference(resolution,[status(thm)],[c49878,c79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV133+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 9 05:37:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 38.40/38.61 % Version: 1.5
% 38.40/38.61 % SZS status Theorem
% 38.40/38.61 % SZS output start CNFRefutation
% See solution above
% 38.40/38.61
% 38.40/38.61 % Initial clauses : 323
% 38.40/38.61 % Processed clauses : 1319
% 38.40/38.61 % Factors computed : 444
% 38.40/38.61 % Resolvents computed: 49375
% 38.40/38.61 % Tautologies deleted: 5
% 38.40/38.61 % Forward subsumed : 989
% 38.40/38.61 % Backward subsumed : 0
% 38.40/38.61 % -------- CPU Time ---------
% 38.40/38.61 % User time : 38.029 s
% 38.40/38.61 % System time : 0.218 s
% 38.40/38.61 % Total time : 38.247 s
%------------------------------------------------------------------------------