%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV879-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 : n018.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 0.19s 0.64s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 16 unt; 0 nHn; 24 RR)
% Number of literals : 57 ( 4 equ; 28 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 : 15 ( 15 usr; 8 con; 0-4 aty)
% Number of variables : 67 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_CollectD_0,axiom,
( ~ hBOOL(c_in(X2,c_Collect(X1,X3),X3))
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CollectD_0) ).
cnf(cls_rev__image__eqI_0,axiom,
( ~ hBOOL(c_in(X1,X2,X3))
| hBOOL(c_in(hAPP(X4,X1),c_Set_Oimage(X4,X2,X3,X5),X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_rev__image__eqI_0) ).
cnf(cls_conjecture_1,negated_conjecture,
v_G = c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cls_assms_I1_J_0) ).
cnf(cls_Collect__def_0,axiom,
c_Collect(X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Collect__def_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/sandbox2/benchmark/theBenchmark.p',cls_insert__subset_2) ).
cnf(cls_CollectI_0,axiom,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,c_Collect(X2,X3),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CollectI_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(cls_conjecture_2,negated_conjecture,
hBOOL(c_in(v_x,v_U,tc_Com_Opname)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_10,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_11,plain,
( ~ hBOOL(c_in(X2,c_Collect(X1,X3),X3))
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_CollectD_0]) ).
cnf(c_0_12,plain,
( ~ hBOOL(c_in(X1,X2,X3))
| hBOOL(c_in(hAPP(X4,X1),c_Set_Oimage(X4,X2,X3,X5),X5)) ),
inference(fof_simplification,[status(thm)],[cls_rev__image__eqI_0]) ).
cnf(c_0_13,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_10 ).
cnf(c_0_14,negated_conjecture,
v_G = c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),
cls_conjecture_1 ).
cnf(c_0_15,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_16,plain,
( ~ hBOOL(c_in(X2,c_Collect(X1,X3),X3))
| hBOOL(hAPP(X1,X2)) ),
c_0_11 ).
cnf(c_0_17,axiom,
c_Collect(X1,X2) = X1,
cls_Collect__def_0 ).
cnf(c_0_18,plain,
( ~ hBOOL(c_in(X1,X2,X3))
| hBOOL(c_in(hAPP(X4,X1),c_Set_Oimage(X4,X2,X3,X5),X5)) ),
c_0_12 ).
cnf(c_0_19,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_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool))
| hBOOL(hAPP(hAPP(v_P,X1),X2)) ),
c_0_15 ).
cnf(c_0_21,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_22,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,c_Collect(X2,X3),X3)) ),
inference(fof_simplification,[status(thm)],[cls_CollectI_0]) ).
cnf(c_0_23,plain,
( ~ hBOOL(c_in(X2,X1,X3))
| hBOOL(hAPP(X1,X2)) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( ~ hBOOL(c_in(X1,v_U,tc_Com_Opname))
| hBOOL(c_in(hAPP(v_mgt__call,X1),v_G,t_a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_25,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_19,c_0_20]) ).
cnf(c_0_26,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_21 ).
cnf(c_0_27,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_28,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,c_Collect(X2,X3),X3)) ),
c_0_22 ).
cnf(c_0_29,negated_conjecture,
( ~ hBOOL(c_in(X1,v_U,tc_Com_Opname))
| hBOOL(hAPP(v_G,hAPP(v_mgt__call,X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
hBOOL(c_in(v_x,v_U,tc_Com_Opname)),
cls_conjecture_2 ).
cnf(c_0_31,negated_conjecture,
~ hBOOL(c_in(hAPP(v_mgt__call,v_x),v_G,t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_32,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
inference(rw,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_33,negated_conjecture,
hBOOL(hAPP(v_G,hAPP(v_mgt__call,v_x))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 09:32:00 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 0.19/0.64 % Version: 3.5.1
% 0.19/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.64 % Starting sh5l with 300s (1) cores
% 0.19/0.64 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1558092 completed with status 0
% 0.19/0.64 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.64 % No SInE strategy applied
% 0.19/0.64 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.19/0.64 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 0.19/0.64 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.19/0.64 % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.19/0.64 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1558100 completed with status 0
% 0.19/0.64 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.64 % No SInE strategy applied
% 0.19/0.64 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.19/0.64 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.64 % Preprocessing time : 0.009 s
% 0.19/0.64 % Presaturation interreduction done
% 0.19/0.64
% 0.19/0.64 % Proof found!
% 0.19/0.64 % SZS status Unsatisfiable
% 0.19/0.64 % SZS output start CNFRefutation
% See solution above
% 0.19/0.64 % Parsed axioms : 913
% 0.19/0.64 % Removed by relevancy pruning/SinE : 0
% 0.19/0.64 % Initial clauses : 913
% 0.19/0.64 % Removed in clause preprocessing : 3
% 0.19/0.64 % Initial clauses in saturation : 910
% 0.19/0.64 % Processed clauses : 1674
% 0.19/0.64 % ...of these trivial : 24
% 0.19/0.64 % ...subsumed : 310
% 0.19/0.64 % ...remaining for further processing : 1340
% 0.19/0.64 % Other redundant clauses eliminated : 43
% 0.19/0.64 % Clauses deleted for lack of memory : 0
% 0.19/0.64 % Backward-subsumed : 2
% 0.19/0.64 % Backward-rewritten : 4
% 0.19/0.64 % Generated clauses : 4932
% 0.19/0.64 % ...of the previous two non-redundant : 3748
% 0.19/0.64 % ...aggressively subsumed : 0
% 0.19/0.64 % Contextual simplify-reflections : 5
% 0.19/0.64 % Paramodulations : 4882
% 0.19/0.64 % Factorizations : 4
% 0.19/0.64 % NegExts : 0
% 0.19/0.64 % Equation resolutions : 46
% 0.19/0.64 % Disequality decompositions : 0
% 0.19/0.64 % Total rewrite steps : 1875
% 0.19/0.64 % ...of those cached : 1450
% 0.19/0.64 % Propositional unsat checks : 0
% 0.19/0.64 % Propositional check models : 0
% 0.19/0.64 % Propositional check unsatisfiable : 0
% 0.19/0.64 % Propositional clauses : 0
% 0.19/0.64 % Propositional clauses after purity: 0
% 0.19/0.64 % Propositional unsat core size : 0
% 0.19/0.64 % Propositional preprocessing time : 0.000
% 0.19/0.64 % Propositional encoding time : 0.000
% 0.19/0.64 % Propositional solver time : 0.000
% 0.19/0.64 % Success case prop preproc time : 0.000
% 0.19/0.64 % Success case prop encoding time : 0.000
% 0.19/0.64 % Success case prop solver time : 0.000
% 0.19/0.64 % Current number of processed clauses : 578
% 0.19/0.64 % Positive orientable unit clauses : 158
% 0.19/0.64 % Positive unorientable unit clauses: 3
% 0.19/0.64 % Negative unit clauses : 19
% 0.19/0.64 % Non-unit-clauses : 398
% 0.19/0.64 % Current number of unprocessed clauses: 3738
% 0.19/0.64 % ...number of literals in the above : 10118
% 0.19/0.64 % Current number of archived formulas : 0
% 0.19/0.64 % Current number of archived clauses : 763
% 0.19/0.64 % Clause-clause subsumption calls (NU) : 94843
% 0.19/0.64 % Rec. Clause-clause subsumption calls : 61516
% 0.19/0.64 % Non-unit clause-clause subsumptions : 220
% 0.19/0.64 % Unit Clause-clause subsumption calls : 684
% 0.19/0.64 % Rewrite failures with RHS unbound : 0
% 0.19/0.64 % BW rewrite match attempts : 495
% 0.19/0.64 % BW rewrite match successes : 156
% 0.19/0.64 % Condensation attempts : 0
% 0.19/0.64 % Condensation successes : 0
% 0.19/0.64 % Termbank termtop insertions : 119777
% 0.19/0.64 % Search garbage collected termcells : 1732
% 0.19/0.64
% 0.19/0.64 % -------------------------------------------------
% 0.19/0.64 % User time : 0.153 s
% 0.19/0.64 % System time : 0.011 s
% 0.19/0.64 % Total time : 0.164 s
% 0.19/0.64 % Maximum resident set size: 5316 pages
% 0.19/0.64
% 0.19/0.64 % -------------------------------------------------
% 0.19/0.64 % User time : 0.621 s
% 0.19/0.64 % System time : 0.048 s
% 0.19/0.64 % Total time : 0.669 s
% 0.19/0.64 % Maximum resident set size: 5632 pages
% 0.19/0.64 % E exiting
%------------------------------------------------------------------------------