%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWV141+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:19 EDT 2024
% Result : Theorem 43.26s 43.47s
% Output : Refutation 43.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 157 ( 11 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 171 ( 46 ~; 30 |; 54 &)
% ( 0 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-1 aty)
% Number of variables : 36 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0011,conjecture,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_worst7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0011) ).
fof(c66,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_worst7) ),
inference(assume_negation,[status(cth)],[gauss_array_0011]) ).
fof(c67,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_worst7) ),
inference(fof_simplification,[status(thm)],[c66]) ).
fof(c68,negated_conjecture,
( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ~ leq(n0,s_worst7) ),
inference(fof_nnf,[status(thm)],[c67]) ).
cnf(c83,negated_conjecture,
~ leq(n0,s_worst7),
inference(split_conjunct,[status(thm)],[c68]) ).
cnf(c79,negated_conjecture,
( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) ),
inference(split_conjunct,[status(thm)],[c68]) ).
fof(leq_succ_gt,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(c119,plain,
! [X,Y] :
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(fof_nnf,[status(thm)],[leq_succ_gt]) ).
fof(c120,plain,
! [X42,X43] :
( ~ leq(succ(X42),X43)
| gt(X43,X42) ),
inference(variable_rename,[status(thm)],[c119]) ).
cnf(c121,plain,
( ~ leq(succ(X318),X319)
| gt(X319,X318) ),
inference(split_conjunct,[status(thm)],[c120]) ).
cnf(c70,negated_conjecture,
leq(n1,loopcounter),
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(c457,plain,
! [X,Y,Z] :
( ~ leq(X,Y)
| ~ leq(Y,Z)
| leq(X,Z) ),
inference(fof_nnf,[status(thm)],[transitivity_leq]) ).
fof(c458,plain,
! [X170,X171,X172] :
( ~ leq(X170,X171)
| ~ leq(X171,X172)
| leq(X170,X172) ),
inference(variable_rename,[status(thm)],[c457]) ).
cnf(c459,plain,
( ~ leq(X2095,X2093)
| ~ leq(X2093,X2094)
| leq(X2095,X2094) ),
inference(split_conjunct,[status(thm)],[c458]) ).
cnf(c23062,plain,
( ~ leq(X2169,n1)
| leq(X2169,loopcounter) ),
inference(resolution,[status(thm)],[c459,c70]) ).
cnf(symmetry,axiom,
( X183 != X184
| X184 = X183 ),
theory(equality) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
cnf(c24,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c484,plain,
n1 = succ(n0),
inference(resolution,[status(thm)],[c24,symmetry]) ).
cnf(reflexivity,axiom,
X180 = X180,
theory(equality) ).
fof(reflexivity_leq,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(c460,plain,
! [X173] : leq(X173,X173),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c461,plain,
leq(X181,X181),
inference(split_conjunct,[status(thm)],[c460]) ).
cnf(c19,axiom,
( X286 != X285
| X283 != X284
| ~ leq(X286,X283)
| leq(X285,X284) ),
theory(equality) ).
cnf(c700,plain,
( X2847 != X2846
| X2847 != X2848
| leq(X2846,X2848) ),
inference(resolution,[status(thm)],[c19,c461]) ).
cnf(c52923,plain,
( X2851 != X2852
| leq(X2852,X2851) ),
inference(resolution,[status(thm)],[c700,reflexivity]) ).
cnf(c53014,plain,
leq(succ(n0),n1),
inference(resolution,[status(thm)],[c52923,c484]) ).
cnf(c53758,plain,
leq(succ(n0),loopcounter),
inference(resolution,[status(thm)],[c53014,c23062]) ).
cnf(c54919,plain,
gt(loopcounter,n0),
inference(resolution,[status(thm)],[c53758,c121]) ).
cnf(c54992,plain,
leq(n0,s_worst7),
inference(resolution,[status(thm)],[c54919,c79]) ).
cnf(c55186,plain,
$false,
inference(resolution,[status(thm)],[c54992,c83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV141+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 9 05:25:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 43.26/43.47 % Version: 1.5
% 43.26/43.47 % SZS status Theorem
% 43.26/43.47 % SZS output start CNFRefutation
% See solution above
% 43.26/43.47
% 43.26/43.47 % Initial clauses : 327
% 43.26/43.47 % Processed clauses : 1461
% 43.26/43.47 % Factors computed : 445
% 43.26/43.47 % Resolvents computed: 54361
% 43.26/43.47 % Tautologies deleted: 5
% 43.26/43.47 % Forward subsumed : 1129
% 43.26/43.47 % Backward subsumed : 2
% 43.26/43.47 % -------- CPU Time ---------
% 43.26/43.47 % User time : 42.862 s
% 43.26/43.47 % System time : 0.243 s
% 43.26/43.47 % Total time : 43.105 s
%------------------------------------------------------------------------------