%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV879-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:03 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.74s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 19 unt; 0 nHn; 27 RR)
% Number of literals : 56 ( 11 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-4 aty)
% Number of variables : 70 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_insert__absorb_0,axiom,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__absorb_0) ).
cnf(cls_insert__image_0,axiom,
( ~ hBOOL(c_in(X2,X3,X4))
| c_Set_Oinsert(hAPP(X1,X2),c_Set_Oimage(X1,X3,X4,X5),X5) = c_Set_Oimage(X1,X3,X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__image_0) ).
cnf(cls_insert__subset_0,axiom,
( ~ c_lessequals(c_Set_Oinsert(X1,X4,X3),X2,tc_fun(X3,tc_bool))
| hBOOL(c_in(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__subset_0) ).
cnf(cls_conjecture_2,negated_conjecture,
hBOOL(c_in(v_x,v_U,tc_Com_Opname)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a)),c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_1,negated_conjecture,
v_G = c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_assms_I1_J_0,axiom,
( ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool))
| hBOOL(hAPP(hAPP(v_P,X1),X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_assms_I1_J_0) ).
cnf(cls_equalityE_0,axiom,
c_lessequals(X1,X1,tc_fun(X2,tc_bool)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_equalityE_0) ).
cnf(cls_insert__subset_2,axiom,
( ~ hBOOL(c_in(X1,X4,X3))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__subset_2) ).
cnf(cls_insert__iff_1,axiom,
hBOOL(c_in(X1,c_Set_Oinsert(X1,X2,X3),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__iff_1) ).
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/sandbox/benchmark/theBenchmark.p',cls_empty__subsetI_0) ).
cnf(c_0_11,plain,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).
cnf(c_0_12,plain,
( ~ hBOOL(c_in(X2,X3,X4))
| c_Set_Oinsert(hAPP(X1,X2),c_Set_Oimage(X1,X3,X4,X5),X5) = c_Set_Oimage(X1,X3,X4,X5) ),
inference(fof_simplification,[status(thm)],[cls_insert__image_0]) ).
cnf(c_0_13,plain,
( ~ c_lessequals(c_Set_Oinsert(X1,X4,X3),X2,tc_fun(X3,tc_bool))
| hBOOL(c_in(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[cls_insert__subset_0]) ).
cnf(c_0_14,plain,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
hBOOL(c_in(v_x,v_U,tc_Com_Opname)),
cls_conjecture_2 ).
cnf(c_0_16,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a)),c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_17,plain,
( ~ hBOOL(c_in(X2,X3,X4))
| c_Set_Oinsert(hAPP(X1,X2),c_Set_Oimage(X1,X3,X4,X5),X5) = c_Set_Oimage(X1,X3,X4,X5) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
v_G = c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),
cls_conjecture_1 ).
cnf(c_0_19,plain,
( ~ c_lessequals(c_Set_Oinsert(X1,X4,X3),X2,tc_fun(X3,tc_bool))
| hBOOL(c_in(X1,X2,X3)) ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
c_Set_Oinsert(v_x,v_U,tc_Com_Opname) = v_U,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a)),c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
c_0_16 ).
cnf(c_0_22,plain,
( ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool))
| hBOOL(hAPP(hAPP(v_P,X1),X2)) ),
inference(fof_simplification,[status(thm)],[cls_assms_I1_J_0]) ).
cnf(c_0_23,negated_conjecture,
( ~ hBOOL(c_in(X1,v_U,tc_Com_Opname))
| c_Set_Oinsert(hAPP(v_mgt__call,X1),v_G,t_a) = v_G ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ c_lessequals(v_U,X1,tc_fun(tc_Com_Opname,tc_bool))
| hBOOL(c_in(v_x,X1,tc_Com_Opname)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
c_lessequals(X1,X1,tc_fun(X2,tc_bool)),
cls_equalityE_0 ).
cnf(c_0_26,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
inference(rw,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_27,plain,
( ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool))
| hBOOL(hAPP(hAPP(v_P,X1),X2)) ),
c_0_22 ).
cnf(c_0_28,plain,
( ~ hBOOL(c_in(X1,X4,X3))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) ),
inference(fof_simplification,[status(thm)],[cls_insert__subset_2]) ).
cnf(c_0_29,axiom,
hBOOL(c_in(X1,c_Set_Oinsert(X1,X2,X3),X3)),
cls_insert__iff_1 ).
cnf(c_0_30,negated_conjecture,
c_Set_Oinsert(hAPP(v_mgt__call,v_x),v_G,t_a) = v_G,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a),v_G,tc_fun(t_a,tc_bool)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ hBOOL(c_in(X1,X4,X3))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) ),
c_0_28 ).
cnf(c_0_33,negated_conjecture,
hBOOL(c_in(hAPP(v_mgt__call,v_x),v_G,t_a)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,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_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV879-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n017.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 09:25:17 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/5.74 % Version: 3.5.1
% 0.15/5.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.74 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.74 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.74 % Starting sh5l with 300s (1) cores
% 0.15/5.74 % new_bool_1 with pid 1990813 completed with status 0
% 0.15/5.74 % Result found by new_bool_1
% 0.15/5.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.74 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.74 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.74 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.74 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.74 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.15/5.74 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.74 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.74 % SubtermCWHack with pid 1990815 completed with status 0
% 0.15/5.74 % Result found by SubtermCWHack
% 0.15/5.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.74 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.74 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.74 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.74 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.74 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.15/5.74 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.74 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.74 % Preprocessing time : 0.006 s
% 0.15/5.74
% 0.15/5.74 % Proof found!
% 0.15/5.74 % SZS status Unsatisfiable
% 0.15/5.74 % SZS output start CNFRefutation
% See solution above
% 0.15/5.74 % Parsed axioms : 913
% 0.15/5.74 % Removed by relevancy pruning/SinE : 550
% 0.15/5.74 % Initial clauses : 363
% 0.15/5.74 % Removed in clause preprocessing : 0
% 0.15/5.74 % Initial clauses in saturation : 363
% 0.15/5.74 % Processed clauses : 2685
% 0.15/5.74 % ...of these trivial : 206
% 0.15/5.74 % ...subsumed : 1769
% 0.15/5.74 % ...remaining for further processing : 710
% 0.15/5.74 % Other redundant clauses eliminated : 48
% 0.15/5.74 % Clauses deleted for lack of memory : 0
% 0.15/5.74 % Backward-subsumed : 14
% 0.15/5.74 % Backward-rewritten : 7
% 0.15/5.74 % Generated clauses : 16100
% 0.15/5.74 % ...of the previous two non-redundant : 12668
% 0.15/5.74 % ...aggressively subsumed : 0
% 0.15/5.74 % Contextual simplify-reflections : 4
% 0.15/5.74 % Paramodulations : 16034
% 0.15/5.74 % Factorizations : 14
% 0.15/5.74 % NegExts : 0
% 0.15/5.74 % Equation resolutions : 52
% 0.15/5.74 % Disequality decompositions : 0
% 0.15/5.74 % Total rewrite steps : 8018
% 0.15/5.74 % ...of those cached : 6790
% 0.15/5.74 % Propositional unsat checks : 0
% 0.15/5.74 % Propositional check models : 0
% 0.15/5.74 % Propositional check unsatisfiable : 0
% 0.15/5.74 % Propositional clauses : 0
% 0.15/5.74 % Propositional clauses after purity: 0
% 0.15/5.74 % Propositional unsat core size : 0
% 0.15/5.74 % Propositional preprocessing time : 0.000
% 0.15/5.74 % Propositional encoding time : 0.000
% 0.15/5.74 % Propositional solver time : 0.000
% 0.15/5.74 % Success case prop preproc time : 0.000
% 0.15/5.74 % Success case prop encoding time : 0.000
% 0.15/5.74 % Success case prop solver time : 0.000
% 0.15/5.74 % Current number of processed clauses : 689
% 0.15/5.74 % Positive orientable unit clauses : 229
% 0.15/5.74 % Positive unorientable unit clauses: 10
% 0.15/5.74 % Negative unit clauses : 36
% 0.15/5.74 % Non-unit-clauses : 414
% 0.15/5.74 % Current number of unprocessed clauses: 10320
% 0.15/5.74 % ...number of literals in the above : 23729
% 0.15/5.74 % Current number of archived formulas : 0
% 0.15/5.74 % Current number of archived clauses : 21
% 0.15/5.74 % Clause-clause subsumption calls (NU) : 22093
% 0.15/5.74 % Rec. Clause-clause subsumption calls : 19489
% 0.15/5.74 % Non-unit clause-clause subsumptions : 1302
% 0.15/5.74 % Unit Clause-clause subsumption calls : 722
% 0.15/5.74 % Rewrite failures with RHS unbound : 0
% 0.15/5.74 % BW rewrite match attempts : 2084
% 0.15/5.74 % BW rewrite match successes : 62
% 0.15/5.74 % Condensation attempts : 0
% 0.15/5.74 % Condensation successes : 0
% 0.15/5.74 % Termbank termtop insertions : 295665
% 0.15/5.74 % Search garbage collected termcells : 2998
% 0.15/5.74
% 0.15/5.74 % -------------------------------------------------
% 0.15/5.74 % User time : 0.258 s
% 0.15/5.74 % System time : 0.010 s
% 0.15/5.74 % Total time : 0.268 s
% 0.15/5.74 % Maximum resident set size: 4804 pages
% 0.15/5.74
% 0.15/5.74 % -------------------------------------------------
% 0.15/5.74 % User time : 0.286 s
% 0.15/5.74 % System time : 0.014 s
% 0.15/5.74 % Total time : 0.300 s
% 0.15/5.74 % Maximum resident set size: 5376 pages
% 0.15/5.74 % E exiting
%------------------------------------------------------------------------------