%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET851-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:37:08 AM UTC 2026
% Result : Unsatisfiable 23.56s 8.48s
% Output : CNFRefutation 23.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 47 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 18 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 20 ( 4 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
! [VAR_0,VAR_1] :
( c_lessequals(VAR_1,VAR_1,VAR_0)
| ~ class_Orderings_Oorder(VAR_0) ),
file('theBenchmark.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).
cnf(c_2,plain,
( c_lessequals(B,B,A)
| ~ class_Orderings_Oorder(A) ),
inference(clausify,[status(thm)],[cls_Orderings_Oorder__class_Oaxioms__1_0]) ).
fof(clsarity_set_2,axiom,
! [VAR_0] : class_Orderings_Oorder(tc_set(VAR_0)),
file('theBenchmark.p',clsarity_set_2) ).
cnf(c_9,plain,
class_Orderings_Oorder(tc_set(A)),
inference(clausify,[status(thm)],[clsarity_set_2]) ).
fof(cls_Zorn_Osucc__trans_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( c_lessequals(VAR_0,c_Zorn_Osucc(VAR_3,VAR_1,VAR_2),tc_set(tc_set(VAR_2)))
| ~ c_lessequals(VAR_0,VAR_1,tc_set(tc_set(VAR_2))) ),
file('theBenchmark.p',cls_Zorn_Osucc__trans_0) ).
cnf(c_1146,plain,
( c_lessequals(A,c_Zorn_Osucc(D,B,C),tc_set(tc_set(C)))
| ~ c_lessequals(A,B,tc_set(tc_set(C))) ),
inference(clausify,[status(thm)],[cls_Zorn_Osucc__trans_0]) ).
fof(cls_conjecture_1,axiom,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_1148,plain,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
fof(cls_conjecture_2,axiom,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(c_1149,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
inference(clausify,[status(thm)],[cls_conjecture_2]) ).
fof(cls_conjecture_3,axiom,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
file('theBenchmark.p',cls_conjecture_3) ).
cnf(c_1150,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
inference(clausify,[status(thm)],[cls_conjecture_3]) ).
fof(cls_conjecture_4,axiom,
( c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))) ),
file('theBenchmark.p',cls_conjecture_4) ).
cnf(c_1151,plain,
( c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))) ),
inference(clausify,[status(thm)],[cls_conjecture_4]) ).
fof(cls_conjecture_5,axiom,
! [VAR_0] :
( ~ c_in(VAR_0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(VAR_0,v_m,tc_set(tc_set(t_a)))
| VAR_0 = v_m
| c_lessequals(c_Zorn_Osucc(v_S,VAR_0,t_a),v_m,tc_set(tc_set(t_a))) ),
file('theBenchmark.p',cls_conjecture_5) ).
cnf(c_1152,plain,
( ~ c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(A,v_m,tc_set(tc_set(t_a)))
| A = v_m
| c_lessequals(c_Zorn_Osucc(v_S,A,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(clausify,[status(thm)],[cls_conjecture_5]) ).
cnf(c_1153,plain,
( ~ c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(A,v_m,tc_set(tc_set(t_a)))
| v_m = A
| c_lessequals(c_Zorn_Osucc(v_S,A,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(copy,[status(thm)],[c_1152]) ).
cnf(c_1166,plain,
c_lessequals(A,A,tc_set(B)),
inference(resolve,[status(thm)],[c_9,c_2]) ).
cnf(c_2081,plain,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(A,v_x,t_a),tc_set(tc_set(t_a)))
| c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
inference(resolve,[status(thm)],[c_1151,c_1146]) ).
cnf(c_3491,plain,
( ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| v_m = v_x
| c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(resolve,[status(thm)],[c_1153,c_1148]) ).
cnf(c_3492,plain,
( ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| v_x = v_m
| c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(copy,[status(thm)],[c_3491]) ).
cnf(c_2082,plain,
( ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| v_x = v_m ),
inference(resolve,[status(thm)],[c_1149,c_3492]) ).
cnf(c_3488,plain,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
inference(resolve,[status(thm)],[c_2081,c_1150]) ).
cnf(c_3489,plain,
v_x = v_m,
inference(resolve,[status(thm)],[c_3488,c_2082]) ).
cnf(c_3493,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_m,t_a),tc_set(tc_set(t_a))),
inference(paramod,[status(thm)],[c_3489,c_1150]) ).
cnf(c_3490,plain,
$false,
inference(resolve,[status(thm)],[c_1166,c_3493]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET851-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/5.40 % Computer : n001.cluster.edu
% 0.14/5.40 % Model : x86_64 x86_64
% 0.14/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.40 % Memory : 8046.5625MB
% 0.14/5.40 % OS : Linux 6.8.0-71-generic
% 0.14/5.40 % CPULimit : 300
% 0.14/5.40 % WCLimit : 300
% 0.14/5.40 % DateTime : Sat Sep 26 08:27:34 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/5.41 % Process 1366511 was started by sandbox2 on n001,
% 0.14/5.41 % Sat Sep 26 08:27:34 2026
% 0.14/5.41 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/5.46
% 0.14/5.46 % From the command line: assign(max_seconds, 300).
% 23.56/8.48
% 23.56/8.48 % given #500 (I,wt=22): 1440 -class_OrderedGroup_Opordered__ab__semigroup__add(A) | -c_less(B,C,A) | c_in(C,c_SetInterval_OgreaterThan(B,A),A). [resolve(95,b,80,a)].
% 23.56/8.48
% 23.56/8.48 % given #1000 (I,wt=23): 2017 -c_lessequals(A,B,tc_IntDef_Oint) | c_lessequals(c_SetInterval_OgreaterThan(B,tc_IntDef_Oint),c_SetInterval_OgreaterThan(A,tc_IntDef_Oint),tc_set(tc_IntDef_Oint)). [resolve(62,a,58,a)].
% 23.56/8.48
% 23.56/8.48 % SZS status Unsatisfiable for theBenchmark
% 23.56/8.48
% 23.56/8.48 % Proof 1 at 2.86 (+ 0.11) seconds.
% 23.56/8.48 % Length of proof is 15.
% 23.56/8.48 % Level of proof is 4.
% 23.56/8.48 % Maximum clause weight is 47.000.
% 23.56/8.48 % Given clauses 1064.
% 23.56/8.48
% 23.56/8.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------