%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV882-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 : n010.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:00:07 PM UTC 2026
% Result : Unsatisfiable 1.61s 0.84s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 14 unt; 0 nHn; 18 RR)
% Number of literals : 41 ( 4 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 47 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_insert__absorb_0,axiom,
( ~ c_in(X1,X2,X3)
| c_Set_Oinsert(X1,X2,X3) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__absorb_0) ).
cnf(cls_conjecture_5,negated_conjecture,
c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_6,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
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/sandbox2/benchmark/theBenchmark.p',cls_assms_I1_J_0) ).
cnf(cls_mem__def_1,axiom,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_insert__code_1,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__code_1) ).
cnf(cls_insert__subset_2,axiom,
( ~ 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/sandbox2/benchmark/theBenchmark.p',cls_insert__subset_2) ).
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_in(X1,X2,X3)
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).
cnf(c_0_9,plain,
( ~ c_in(X1,X2,X3)
| c_Set_Oinsert(X1,X2,X3) = X2 ),
c_0_8 ).
cnf(c_0_10,negated_conjecture,
c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
cls_conjecture_5 ).
cnf(c_0_11,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_12,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_13,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_14,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
cls_insert__code_1 ).
cnf(c_0_15,negated_conjecture,
c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a) = v_G,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
c_0_11 ).
cnf(c_0_17,plain,
( ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool))
| hBOOL(hAPP(hAPP(v_P,X1),X2)) ),
c_0_12 ).
cnf(c_0_18,plain,
( ~ 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_19,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
hBOOL(hAPP(v_G,hAPP(v_mgt__call,v_pn))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),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_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ 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_18 ).
cnf(c_0_23,negated_conjecture,
c_in(hAPP(v_mgt__call,v_pn),v_G,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,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_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV882-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.12/0.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 09:30:25 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 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.61/0.84 % Version: 3.5.1
% 1.61/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.61/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.61/0.84 % Starting new_bool_3 with 300s (1) cores
% 1.61/0.84 % Starting new_bool_1 with 300s (1) cores
% 1.61/0.84 % Starting sh5l with 300s (1) cores
% 1.61/0.84 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 574621 completed with status 0
% 1.61/0.84 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.61/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.61/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.61/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.61/0.84 % No SInE strategy applied
% 1.61/0.84 % Search class: FGHSM-FSLM32-DFFFFFNN
% 1.61/0.84 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.61/0.84 % Starting SubtermCWHack with 136s (1) cores
% 1.61/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.61/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 1.61/0.84 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 1.61/0.84 % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 1.61/0.84 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 574629 completed with status 0
% 1.61/0.84 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.61/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.61/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.61/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.61/0.84 % No SInE strategy applied
% 1.61/0.84 % Search class: FGHSM-FSLM32-DFFFFFNN
% 1.61/0.84 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.61/0.84 % Starting SubtermCWHack with 136s (1) cores
% 1.61/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.61/0.84 % Preprocessing time : 0.015 s
% 1.61/0.84 % Presaturation interreduction done
% 1.61/0.84
% 1.61/0.84 % Proof found!
% 1.61/0.84 % SZS status Unsatisfiable
% 1.61/0.84 % SZS output start CNFRefutation
% See solution above
% 1.61/0.84 % Parsed axioms : 627
% 1.61/0.84 % Removed by relevancy pruning/SinE : 0
% 1.61/0.84 % Initial clauses : 627
% 1.61/0.84 % Removed in clause preprocessing : 1
% 1.61/0.84 % Initial clauses in saturation : 626
% 1.61/0.84 % Processed clauses : 1296
% 1.61/0.84 % ...of these trivial : 38
% 1.61/0.84 % ...subsumed : 272
% 1.61/0.84 % ...remaining for further processing : 986
% 1.61/0.84 % Other redundant clauses eliminated : 66
% 1.61/0.84 % Clauses deleted for lack of memory : 0
% 1.61/0.84 % Backward-subsumed : 17
% 1.61/0.84 % Backward-rewritten : 31
% 1.61/0.84 % Generated clauses : 4546
% 1.61/0.84 % ...of the previous two non-redundant : 3622
% 1.61/0.84 % ...aggressively subsumed : 0
% 1.61/0.84 % Contextual simplify-reflections : 4
% 1.61/0.84 % Paramodulations : 4471
% 1.61/0.84 % Factorizations : 4
% 1.61/0.84 % NegExts : 0
% 1.61/0.84 % Equation resolutions : 71
% 1.61/0.84 % Disequality decompositions : 0
% 1.61/0.84 % Total rewrite steps : 2498
% 1.61/0.84 % ...of those cached : 2104
% 1.61/0.84 % Propositional unsat checks : 0
% 1.61/0.84 % Propositional check models : 0
% 1.61/0.84 % Propositional check unsatisfiable : 0
% 1.61/0.84 % Propositional clauses : 0
% 1.61/0.84 % Propositional clauses after purity: 0
% 1.61/0.84 % Propositional unsat core size : 0
% 1.61/0.84 % Propositional preprocessing time : 0.000
% 1.61/0.84 % Propositional encoding time : 0.000
% 1.61/0.84 % Propositional solver time : 0.000
% 1.61/0.84 % Success case prop preproc time : 0.000
% 1.61/0.84 % Success case prop encoding time : 0.000
% 1.61/0.84 % Success case prop solver time : 0.000
% 1.61/0.84 % Current number of processed clauses : 461
% 1.61/0.84 % Positive orientable unit clauses : 95
% 1.61/0.84 % Positive unorientable unit clauses: 5
% 1.61/0.84 % Negative unit clauses : 26
% 1.61/0.84 % Non-unit-clauses : 335
% 1.61/0.84 % Current number of unprocessed clauses: 3407
% 1.61/0.84 % ...number of literals in the above : 8902
% 1.61/0.84 % Current number of archived formulas : 0
% 1.61/0.84 % Current number of archived clauses : 526
% 1.61/0.84 % Clause-clause subsumption calls (NU) : 33905
% 1.61/0.84 % Rec. Clause-clause subsumption calls : 24731
% 1.61/0.84 % Non-unit clause-clause subsumptions : 158
% 1.61/0.84 % Unit Clause-clause subsumption calls : 163
% 1.61/0.84 % Rewrite failures with RHS unbound : 26
% 1.61/0.84 % BW rewrite match attempts : 161
% 1.61/0.84 % BW rewrite match successes : 75
% 1.61/0.84 % Condensation attempts : 0
% 1.61/0.84 % Condensation successes : 0
% 1.61/0.84 % Termbank termtop insertions : 92162
% 1.61/0.84 % Search garbage collected termcells : 1225
% 1.61/0.84
% 1.61/0.84 % -------------------------------------------------
% 1.61/0.84 % User time : 0.270 s
% 1.61/0.84 % System time : 0.021 s
% 1.61/0.84 % Total time : 0.291 s
% 1.61/0.84 % Maximum resident set size: 4848 pages
% 1.61/0.84
% 1.61/0.84 % -------------------------------------------------
% 1.61/0.84 % User time : 0.704 s
% 1.61/0.84 % System time : 0.062 s
% 1.61/0.84 % Total time : 0.766 s
% 1.61/0.84 % Maximum resident set size: 5120 pages
% 1.61/0.84 % E exiting
%------------------------------------------------------------------------------