%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV578-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 : Thu Sep 24 03:06:32 PM UTC 2026
% Result : Unsatisfiable 1.72s 0.71s
% Output : CNFRefutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 11 unt; 0 nHn; 9 RR)
% Number of literals : 20 ( 9 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
hAPP(hAPP(c_HOL_Oplus__class_Oplus(t_a),hAPP(v_f,v_m)),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat,t_a)) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_atLeastSucLessThan__greaterThanLessThan_0,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,X1),X2,tc_nat) = c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_atLeastSucLessThan__greaterThanLessThan_0) ).
cnf(cls_setsum__head__upt__Suc_0,axiom,
( ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X3,tc_nat),X4))
| ~ class_OrderedGroup_Ocomm__monoid__add(X1)
| c_Finite__Set_Osetsum(X2,c_SetInterval_Oord__class_OatLeastLessThan(X3,X4,tc_nat),tc_nat,X1) = hAPP(hAPP(c_HOL_Oplus__class_Oplus(X1),hAPP(X2,X3)),c_Finite__Set_Osetsum(X2,c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,X3),X4,tc_nat),tc_nat,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_setsum__head__upt__Suc_0) ).
cnf(tfree_tcs,negated_conjecture,
class_OrderedGroup_Ocomm__monoid__add(t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(cls_less_0,axiom,
hBOOL(hAPP(c_HOL_Oord__class_Oless(v_m,tc_nat),v_n)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_less_0) ).
cnf(c_0_5,negated_conjecture,
hAPP(hAPP(c_HOL_Oplus__class_Oplus(t_a),hAPP(v_f,v_m)),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat,t_a)) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_6,negated_conjecture,
hAPP(hAPP(c_HOL_Oplus__class_Oplus(t_a),hAPP(v_f,v_m)),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat,t_a)) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
c_0_5 ).
cnf(c_0_7,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,X1),X2,tc_nat) = c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,tc_nat),
cls_atLeastSucLessThan__greaterThanLessThan_0 ).
cnf(c_0_8,plain,
( ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X3,tc_nat),X4))
| ~ class_OrderedGroup_Ocomm__monoid__add(X1)
| c_Finite__Set_Osetsum(X2,c_SetInterval_Oord__class_OatLeastLessThan(X3,X4,tc_nat),tc_nat,X1) = hAPP(hAPP(c_HOL_Oplus__class_Oplus(X1),hAPP(X2,X3)),c_Finite__Set_Osetsum(X2,c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,X3),X4,tc_nat),tc_nat,X1)) ),
inference(fof_simplification,[status(thm)],[cls_setsum__head__upt__Suc_0]) ).
cnf(c_0_9,negated_conjecture,
hAPP(hAPP(c_HOL_Oplus__class_Oplus(t_a),hAPP(v_f,v_m)),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,v_m),v_n,tc_nat),tc_nat,t_a)) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X3,tc_nat),X4))
| ~ class_OrderedGroup_Ocomm__monoid__add(X1)
| c_Finite__Set_Osetsum(X2,c_SetInterval_Oord__class_OatLeastLessThan(X3,X4,tc_nat),tc_nat,X1) = hAPP(hAPP(c_HOL_Oplus__class_Oplus(X1),hAPP(X2,X3)),c_Finite__Set_Osetsum(X2,c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,X3),X4,tc_nat),tc_nat,X1)) ),
c_0_8 ).
cnf(c_0_11,negated_conjecture,
class_OrderedGroup_Ocomm__monoid__add(t_a),
tfree_tcs ).
cnf(c_0_12,axiom,
hBOOL(hAPP(c_HOL_Oord__class_Oless(v_m,tc_nat),v_n)),
cls_less_0 ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV578-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 09:11:27 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.72/0.71 % Version: 3.5.1
% 1.72/0.71 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.72/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.72/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.72/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.72/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.72/0.71 % Starting sh5l with 300s (1) cores
% 1.72/0.71 % new_bool_1 with pid 1535379 completed with status 0
% 1.72/0.71 % Result found by new_bool_1
% 1.72/0.71 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.72/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.72/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.72/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.72/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.72/0.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.72/0.71 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.72/0.71 % Search class: FGHSM-FSLM31-DFFFFFNN
% 1.72/0.71 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.72/0.71 % Starting SubtermCWHack with 28s (1) cores
% 1.72/0.71 % SubtermCWHack with pid 1535382 completed with status 0
% 1.72/0.71 % Result found by SubtermCWHack
% 1.72/0.71 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.72/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.72/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.72/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.72/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.72/0.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.72/0.71 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.72/0.71 % Search class: FGHSM-FSLM31-DFFFFFNN
% 1.72/0.71 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.72/0.71 % Starting SubtermCWHack with 28s (1) cores
% 1.72/0.71 % Preprocessing time : 0.005 s
% 1.72/0.71
% 1.72/0.71 % Proof found!
% 1.72/0.71 % SZS status Unsatisfiable
% 1.72/0.71 % SZS output start CNFRefutation
% See solution above
% 1.72/0.71 % Parsed axioms : 1225
% 1.72/0.71 % Removed by relevancy pruning/SinE : 582
% 1.72/0.71 % Initial clauses : 643
% 1.72/0.71 % Removed in clause preprocessing : 0
% 1.72/0.71 % Initial clauses in saturation : 643
% 1.72/0.71 % Processed clauses : 3542
% 1.72/0.71 % ...of these trivial : 253
% 1.72/0.71 % ...subsumed : 2420
% 1.72/0.71 % ...remaining for further processing : 869
% 1.72/0.71 % Other redundant clauses eliminated : 39
% 1.72/0.71 % Clauses deleted for lack of memory : 0
% 1.72/0.71 % Backward-subsumed : 8
% 1.72/0.71 % Backward-rewritten : 4
% 1.72/0.71 % Generated clauses : 19673
% 1.72/0.71 % ...of the previous two non-redundant : 16072
% 1.72/0.71 % ...aggressively subsumed : 0
% 1.72/0.71 % Contextual simplify-reflections : 0
% 1.72/0.71 % Paramodulations : 19621
% 1.72/0.71 % Factorizations : 8
% 1.72/0.71 % NegExts : 0
% 1.72/0.71 % Equation resolutions : 44
% 1.72/0.71 % Disequality decompositions : 0
% 1.72/0.71 % Total rewrite steps : 13201
% 1.72/0.71 % ...of those cached : 12406
% 1.72/0.71 % Propositional unsat checks : 0
% 1.72/0.71 % Propositional check models : 0
% 1.72/0.71 % Propositional check unsatisfiable : 0
% 1.72/0.71 % Propositional clauses : 0
% 1.72/0.71 % Propositional clauses after purity: 0
% 1.72/0.71 % Propositional unsat core size : 0
% 1.72/0.71 % Propositional preprocessing time : 0.000
% 1.72/0.71 % Propositional encoding time : 0.000
% 1.72/0.71 % Propositional solver time : 0.000
% 1.72/0.71 % Success case prop preproc time : 0.000
% 1.72/0.71 % Success case prop encoding time : 0.000
% 1.72/0.71 % Success case prop solver time : 0.000
% 1.72/0.71 % Current number of processed clauses : 857
% 1.72/0.71 % Positive orientable unit clauses : 186
% 1.72/0.71 % Positive unorientable unit clauses: 13
% 1.72/0.71 % Negative unit clauses : 98
% 1.72/0.71 % Non-unit-clauses : 560
% 1.72/0.71 % Current number of unprocessed clauses: 13165
% 1.72/0.71 % ...number of literals in the above : 45791
% 1.72/0.71 % Current number of archived formulas : 0
% 1.72/0.71 % Current number of archived clauses : 12
% 1.72/0.71 % Clause-clause subsumption calls (NU) : 76580
% 1.72/0.71 % Rec. Clause-clause subsumption calls : 28878
% 1.72/0.71 % Non-unit clause-clause subsumptions : 1030
% 1.72/0.71 % Unit Clause-clause subsumption calls : 1733
% 1.72/0.71 % Rewrite failures with RHS unbound : 0
% 1.72/0.71 % BW rewrite match attempts : 3595
% 1.72/0.71 % BW rewrite match successes : 54
% 1.72/0.71 % Condensation attempts : 0
% 1.72/0.71 % Condensation successes : 0
% 1.72/0.71 % Termbank termtop insertions : 415801
% 1.72/0.71 % Search garbage collected termcells : 3600
% 1.72/0.71
% 1.72/0.71 % -------------------------------------------------
% 1.72/0.71 % User time : 0.224 s
% 1.72/0.71 % System time : 0.015 s
% 1.72/0.71 % Total time : 0.239 s
% 1.72/0.71 % Maximum resident set size: 5292 pages
% 1.72/0.71
% 1.72/0.71 % -------------------------------------------------
% 1.72/0.71 % User time : 0.263 s
% 1.72/0.71 % System time : 0.021 s
% 1.72/0.71 % Total time : 0.284 s
% 1.72/0.71 % Maximum resident set size: 5632 pages
% 1.72/0.71 % E exiting
%------------------------------------------------------------------------------