%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV841-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 : n012.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:07:00 PM UTC 2026
% Result : Unsatisfiable 1.28s 0.61s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 10 unt; 0 nHn; 20 RR)
% Number of literals : 53 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_asm_0,axiom,
( ~ c_lessequals(X2,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_asm_0) ).
cnf(cls_cut_0,axiom,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(X4,X2,X3)
| ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_cut_0) ).
cnf(cls_subset__insertI_0,axiom,
c_lessequals(X1,hAPP(hAPP(c_Set_Oinsert(X2),X3),X1),tc_fun(X2,tc_bool)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_subset__insertI_0) ).
cnf(cls_weaken_0,axiom,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
| ~ c_lessequals(X2,X4,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_weaken_0) ).
cnf(cls_insert__mono_0,axiom,
( ~ c_lessequals(X3,X4,tc_fun(X1,tc_bool))
| c_lessequals(hAPP(hAPP(c_Set_Oinsert(X1),X2),X3),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4),tc_fun(X1,tc_bool)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__mono_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a)
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,v_ts,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),v_ts),t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_empty__subsetI_0,axiom,
c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_empty__subsetI_0) ).
cnf(c_0_8,plain,
( ~ c_lessequals(X2,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_asm_0]) ).
cnf(c_0_9,plain,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(X4,X2,X3)
| ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_cut_0]) ).
cnf(c_0_10,plain,
( ~ c_lessequals(X2,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
c_0_8 ).
cnf(c_0_11,axiom,
c_lessequals(X1,hAPP(hAPP(c_Set_Oinsert(X2),X3),X1),tc_fun(X2,tc_bool)),
cls_subset__insertI_0 ).
cnf(c_0_12,plain,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(X4,X2,X3)
| ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
c_0_9 ).
cnf(c_0_13,plain,
c_Hoare__Mirabelle_Ohoare__derivs(hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X1)),X2),X3),X3,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
| ~ c_lessequals(X2,X4,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_weaken_0]) ).
cnf(c_0_15,plain,
( ~ c_lessequals(X3,X4,tc_fun(X1,tc_bool))
| c_lessequals(hAPP(hAPP(c_Set_Oinsert(X1),X2),X3),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4),tc_fun(X1,tc_bool)) ),
inference(fof_simplification,[status(thm)],[cls_insert__mono_0]) ).
cnf(c_0_16,negated_conjecture,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a)
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,v_ts,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_17,plain,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X3)),X4),X2),X3)
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),v_ts),t_a),
cls_conjecture_0 ).
cnf(c_0_19,plain,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
| ~ c_lessequals(X2,X4,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
| c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ c_lessequals(X3,X4,tc_fun(X1,tc_bool))
| c_lessequals(hAPP(hAPP(c_Set_Oinsert(X1),X2),X3),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4),tc_fun(X1,tc_bool)) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
( ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a)
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,v_ts,t_a) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,v_ts,t_a),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ c_lessequals(X4,X5,tc_fun(tc_Hoare__Mirabelle_Otriple(X2),tc_bool))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X2)),X3),X5),X2)
| c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X2)),X3),X4),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( ~ c_lessequals(X1,v_ts,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))
| c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),X1),t_a) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_26,axiom,
c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
cls_empty__subsetI_0 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV841-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n012.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 09:28:21 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/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.28/0.61 % Version: 3.5.1
% 1.28/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.28/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.28/0.61 % Starting new_bool_3 with 300s (1) cores
% 1.28/0.61 % Starting new_bool_1 with 300s (1) cores
% 1.28/0.61 % Starting sh5l with 300s (1) cores
% 1.28/0.61 % new_bool_1 with pid 2077953 completed with status 0
% 1.28/0.61 % Result found by new_bool_1
% 1.28/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.28/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.28/0.61 % Starting new_bool_3 with 300s (1) cores
% 1.28/0.61 % Starting new_bool_1 with 300s (1) cores
% 1.28/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.28/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.28/0.61 % Search class: FGHSM-FFLF31-DFFFFFNN
% 1.28/0.61 % partial match(1): FGHSM-FFLM31-DFFFFFNN
% 1.28/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.28/0.61 % Starting SubtermCWHack with 31s (1) cores
% 1.28/0.61 % SubtermCWHack with pid 2077956 completed with status 0
% 1.28/0.61 % Result found by SubtermCWHack
% 1.28/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.28/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.28/0.61 % Starting new_bool_3 with 300s (1) cores
% 1.28/0.61 % Starting new_bool_1 with 300s (1) cores
% 1.28/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.28/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.28/0.61 % Search class: FGHSM-FFLF31-DFFFFFNN
% 1.28/0.61 % partial match(1): FGHSM-FFLM31-DFFFFFNN
% 1.28/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.28/0.61 % Starting SubtermCWHack with 31s (1) cores
% 1.28/0.61 % Preprocessing time : 0.003 s
% 1.28/0.61
% 1.28/0.61 % Proof found!
% 1.28/0.61 % SZS status Unsatisfiable
% 1.28/0.61 % SZS output start CNFRefutation
% See solution above
% 1.28/0.61 % Parsed axioms : 527
% 1.28/0.61 % Removed by relevancy pruning/SinE : 397
% 1.28/0.61 % Initial clauses : 130
% 1.28/0.61 % Removed in clause preprocessing : 0
% 1.28/0.61 % Initial clauses in saturation : 130
% 1.28/0.61 % Processed clauses : 1981
% 1.28/0.61 % ...of these trivial : 120
% 1.28/0.61 % ...subsumed : 1448
% 1.28/0.61 % ...remaining for further processing : 413
% 1.28/0.61 % Other redundant clauses eliminated : 38
% 1.28/0.61 % Clauses deleted for lack of memory : 0
% 1.28/0.61 % Backward-subsumed : 2
% 1.28/0.61 % Backward-rewritten : 3
% 1.28/0.61 % Generated clauses : 10459
% 1.28/0.61 % ...of the previous two non-redundant : 8371
% 1.28/0.61 % ...aggressively subsumed : 0
% 1.28/0.61 % Contextual simplify-reflections : 0
% 1.28/0.61 % Paramodulations : 10416
% 1.28/0.61 % Factorizations : 0
% 1.28/0.61 % NegExts : 0
% 1.28/0.61 % Equation resolutions : 43
% 1.28/0.61 % Disequality decompositions : 0
% 1.28/0.61 % Total rewrite steps : 3198
% 1.28/0.61 % ...of those cached : 2250
% 1.28/0.61 % Propositional unsat checks : 0
% 1.28/0.61 % Propositional check models : 0
% 1.28/0.61 % Propositional check unsatisfiable : 0
% 1.28/0.61 % Propositional clauses : 0
% 1.28/0.61 % Propositional clauses after purity: 0
% 1.28/0.61 % Propositional unsat core size : 0
% 1.28/0.61 % Propositional preprocessing time : 0.000
% 1.28/0.61 % Propositional encoding time : 0.000
% 1.28/0.61 % Propositional solver time : 0.000
% 1.28/0.61 % Success case prop preproc time : 0.000
% 1.28/0.61 % Success case prop encoding time : 0.000
% 1.28/0.61 % Success case prop solver time : 0.000
% 1.28/0.61 % Current number of processed clauses : 408
% 1.28/0.61 % Positive orientable unit clauses : 100
% 1.28/0.61 % Positive unorientable unit clauses: 7
% 1.28/0.61 % Negative unit clauses : 6
% 1.28/0.61 % Non-unit-clauses : 295
% 1.28/0.61 % Current number of unprocessed clauses: 6499
% 1.28/0.61 % ...number of literals in the above : 14432
% 1.28/0.61 % Current number of archived formulas : 0
% 1.28/0.61 % Current number of archived clauses : 5
% 1.28/0.61 % Clause-clause subsumption calls (NU) : 11740
% 1.28/0.61 % Rec. Clause-clause subsumption calls : 11146
% 1.28/0.61 % Non-unit clause-clause subsumptions : 1317
% 1.28/0.61 % Unit Clause-clause subsumption calls : 25
% 1.28/0.61 % Rewrite failures with RHS unbound : 0
% 1.28/0.61 % BW rewrite match attempts : 449
% 1.28/0.61 % BW rewrite match successes : 46
% 1.28/0.61 % Condensation attempts : 0
% 1.28/0.61 % Condensation successes : 0
% 1.28/0.61 % Termbank termtop insertions : 229041
% 1.28/0.61 % Search garbage collected termcells : 2069
% 1.28/0.61
% 1.28/0.61 % -------------------------------------------------
% 1.28/0.61 % User time : 0.167 s
% 1.28/0.61 % System time : 0.010 s
% 1.28/0.61 % Total time : 0.177 s
% 1.28/0.61 % Maximum resident set size: 4336 pages
% 1.28/0.61
% 1.28/0.61 % -------------------------------------------------
% 1.28/0.61 % User time : 0.184 s
% 1.28/0.61 % System time : 0.013 s
% 1.28/0.61 % Total time : 0.197 s
% 1.28/0.61 % Maximum resident set size: 5120 pages
% 1.28/0.61 % E exiting
%------------------------------------------------------------------------------