%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV142+1 : TPTP v9.2.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n001.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 : Tue May 5 05:20:55 PM UTC 2026
% Result : Theorem 1.31s 1.74s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 56 ( 28 unt; 0 def)
% Number of atoms : 209 ( 20 equ)
% Maximal formula atoms : 40 ( 3 avg)
% Number of connectives : 220 ( 67 ~; 53 |; 56 &)
% ( 2 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0012,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(s_best7,n3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0012) ).
fof(totality,axiom,
! [X1,X2] :
( gt(X1,X2)
| gt(X2,X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',totality) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(leq_succ_gt_equiv,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(succ_plus_1_l,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
fof(gt_1_0,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(c_0_12,plain,
( epred2_0
<=> ( 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) ) ) ),
introduced(definition) ).
fof(c_0_13,plain,
( epred2_0
=> ( 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) ) ) ),
inference(split_equiv,[status(thm)],[c_0_12]) ).
fof(c_0_14,negated_conjecture,
~ ( epred2_0
=> leq(s_best7,n3) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[gauss_array_0012])]),c_0_12]) ).
fof(c_0_15,plain,
( ( leq(tptp_float_0_001,pv1341)
| ~ epred2_0 )
& ( leq(n1,loopcounter)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3)
| ~ epred2_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
fof(c_0_16,negated_conjecture,
( epred2_0
& ~ leq(s_best7,n3) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
( leq(s_best7,n3)
| ~ gt(loopcounter,n0)
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
epred2_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ leq(s_best7,n3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X196,X197] :
( gt(X196,X197)
| gt(X197,X196)
| X196 = X197 ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_21,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
fof(c_0_22,plain,
! [X219,X220] :
( ( ~ leq(X219,X220)
| gt(succ(X220),X219) )
& ( ~ gt(succ(X220),X219)
| leq(X219,X220) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])]) ).
fof(c_0_23,plain,
! [X303] : plus(X303,n1) = succ(X303),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_24,plain,
! [X210,X211] :
( ~ gt(X211,X210)
| leq(X210,X211) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
cnf(c_0_25,plain,
~ gt(loopcounter,n0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),c_0_19]) ).
cnf(c_0_26,plain,
( gt(X1,X2)
| gt(X2,X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X201] : ~ gt(X201,X201),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( gt(succ(X2),X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,plain,
! [X203,X204,X205] :
( ~ leq(X203,X204)
| ~ leq(X204,X205)
| leq(X203,X205) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
cnf(c_0_31,plain,
( leq(n1,loopcounter)
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_32,plain,
! [X304] : plus(n1,X304) = succ(X304),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
fof(c_0_33,plain,
! [X356] :
( ~ leq(n0,X356)
| ~ leq(X356,n0)
| X356 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_34,plain,
( leq(X2,X1)
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
( loopcounter = n0
| gt(n0,loopcounter) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( gt(plus(X2,n1),X1)
| ~ leq(X1,X2) ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
leq(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_18])]) ).
cnf(c_0_40,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
( X1 = n0
| ~ leq(n0,X1)
| ~ leq(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
( loopcounter = n0
| leq(loopcounter,n0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
gt(n1,n0),
inference(split_conjunct,[status(thm)],[gt_1_0]) ).
cnf(c_0_44,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
( leq(X1,loopcounter)
| ~ leq(X1,n1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_47,plain,
( loopcounter = n0
| ~ leq(n0,loopcounter) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
leq(n0,n1),
inference(spm,[status(thm)],[c_0_34,c_0_43]) ).
cnf(c_0_49,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
fof(c_0_50,plain,
! [X202] : leq(X202,X202),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_51,plain,
~ leq(plus(n1,loopcounter),n1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_52,plain,
loopcounter = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_45]),c_0_48])]) ).
cnf(c_0_53,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_49,c_0_29]) ).
cnf(c_0_54,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_55,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_46]),c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV142+1 : TPTP v9.2.1. Bugfixed v3.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n001.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 04:57:03 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.31/1.74 % Version : CSE_E---1.7
% 1.31/1.74 % Problem : theBenchmark.p
% 1.31/1.74 % SZS status Theorem for theBenchmark.p
% 1.31/1.74 % SZS output start CNFRefutation
% See solution above
% 1.31/1.74 % Total time : 1.373s
%------------------------------------------------------------------------------