%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW368+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:10:23 PM UTC 2026
% Result : Theorem 72.40s 12.39s
% Output : CNFRefutation 72.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 45 ( 21 ~; 16 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-4 aty)
% Number of variables : 48 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_6,conjecture,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_6) ).
fof(fact_le__fun__def,axiom,
! [X1,X2,X9,X7] :
( class_Orderings_Oord(X7)
=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X9,X7)),X2),X1))
<=> ! [X3] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(X7),hAPP(X2,X3)),hAPP(X1,X3))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_le__fun__def) ).
fof(conj_1,hypothesis,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),v_G),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
fof(arity_HOL__Obool__Orderings_Oord,axiom,
class_Orderings_Oord(tc_HOL_Obool),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_HOL__Obool__Orderings_Oord) ).
fof(fact_insert__subset,axiom,
! [X15,X11,X10,X9] :
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X9,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X9),X10),X11)),X15))
<=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X9,tc_HOL_Obool)),X11),X15))
& hBOOL(hAPP(hAPP(c_member(X9),X10),X15)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_insert__subset) ).
fof(fact_imageI,axiom,
! [X2,X7,X11,X10,X9] :
( hBOOL(hAPP(hAPP(c_member(X9),X10),X11))
=> hBOOL(hAPP(hAPP(c_member(X7),hAPP(X2,X10)),hAPP(c_Set_Oimage(X9,X7,X2),X11))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_imageI) ).
fof(conj_4,hypothesis,
hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),v_pn),v_U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).
fof(c_0_7,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(assume_negation,[status(cth)],[conj_6]) ).
fof(c_0_8,plain,
! [X611,X612,X613,X614,X615] :
( ( ~ class_Orderings_Oord(X614)
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X613,X614)),X612),X611))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(X614),hAPP(X612,esk4_4(X611,X612,X613,X614))),hAPP(X611,esk4_4(X611,X612,X613,X614)))) )
& ( ~ class_Orderings_Oord(X614)
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(X614),hAPP(X612,X615)),hAPP(X611,X615)))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X613,X614)),X612),X611)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_le__fun__def])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( ~ class_Orderings_Oord(X2)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,X2)),X3),X4))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(X2),hAPP(X3,X5)),hAPP(X4,X5))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),v_G),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(split_conjunct,[status(thm)],[conj_1]) ).
cnf(c_0_12,plain,
class_Orderings_Oord(tc_HOL_Obool),
inference(split_conjunct,[status(thm)],[arity_HOL__Obool__Orderings_Oord]) ).
fof(c_0_13,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X487,X488,X489,X490] :
( ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X490,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X490),X489),X488)),X487))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X490,tc_HOL_Obool)),X488),X487))
| ~ hBOOL(hAPP(hAPP(c_member(X490),X489),X487)) )
& ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X490,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X490),X489),X488)),X487))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X490,tc_HOL_Obool)),X488),X487)) )
& ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X490,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X490),X489),X488)),X487))
| hBOOL(hAPP(hAPP(c_member(X490),X489),X487)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_insert__subset])])])]) ).
cnf(c_0_15,plain,
( ~ class_Orderings_Oord(X1)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(X1),hAPP(X2,esk4_4(X3,X2,X4,X1))),hAPP(X3,esk4_4(X3,X2,X4,X1))))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X4,X1)),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,hypothesis,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_HOL_Obool),hAPP(v_G,X1)),hAPP(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X4),X3))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4)),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),v_G),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]) ).
fof(c_0_20,plain,
! [X424,X425,X426,X427,X428] :
( hBOOL(hAPP(hAPP(c_member(X425),hAPP(X424,X427)),hAPP(c_Set_Oimage(X428,X425,X424),X426)))
| ~ hBOOL(hAPP(hAPP(c_member(X428),X427),X426)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_imageI])])]) ).
cnf(c_0_21,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3))
| hBOOL(hAPP(hAPP(c_member(X4),hAPP(X5,X2)),hAPP(c_Set_Oimage(X1,X4,X5),X3))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,hypothesis,
hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),v_pn),v_U)),
inference(split_conjunct,[status(thm)],[conj_4]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW368+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n008.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:50:27 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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
% 72.40/12.39 % Version: 3.5.1
% 72.40/12.39 % Preprocessing class: FMLMSMSMSSSNFFN.
% 72.40/12.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 72.40/12.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 72.40/12.39 % Starting new_bool_3 with 300s (1) cores
% 72.40/12.39 % Starting new_bool_1 with 300s (1) cores
% 72.40/12.39 % Starting sh5l with 300s (1) cores
% 72.40/12.39 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 709322 completed with status 0
% 72.40/12.39 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 72.40/12.39 % Preprocessing class: FMLMSMSMSSSNFFN.
% 72.40/12.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 72.40/12.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 72.40/12.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 72.40/12.39 % No SInE strategy applied
% 72.40/12.39 % Search class: FGHSM-SMLM33-DFFFFFNN
% 72.40/12.39 % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 72.40/12.39 % Starting SubtermCWHack with 135s (1) cores
% 72.40/12.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 72.40/12.39 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 135s (1) cores
% 72.40/12.39 % Starting SAT001_CA_MinMin_p005000_rr with 135s (1) cores
% 72.40/12.39 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 135s (1) cores
% 72.40/12.39 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 709336 completed with status 0
% 72.40/12.39 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 72.40/12.39 % Preprocessing class: FMLMSMSMSSSNFFN.
% 72.40/12.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 72.40/12.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 72.40/12.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 72.40/12.39 % No SInE strategy applied
% 72.40/12.39 % Search class: FGHSM-SMLM33-DFFFFFNN
% 72.40/12.39 % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 72.40/12.39 % Starting SubtermCWHack with 135s (1) cores
% 72.40/12.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 72.40/12.39 % Preprocessing time : 0.182 s
% 72.40/12.39 % Presaturation interreduction done
% 72.40/12.39
% 72.40/12.39 % Proof found!
% 72.40/12.39 % SZS status Theorem
% 72.40/12.39 % SZS output start CNFRefutation
% See solution above
% 72.40/12.39 % Parsed axioms : 5230
% 72.40/12.39 % Removed by relevancy pruning/SinE : 0
% 72.40/12.39 % Initial clauses : 7605
% 72.40/12.39 % Removed in clause preprocessing : 245
% 72.40/12.39 % Initial clauses in saturation : 7360
% 72.40/12.39 % Processed clauses : 13104
% 72.40/12.39 % ...of these trivial : 346
% 72.40/12.39 % ...subsumed : 2149
% 72.40/12.39 % ...remaining for further processing : 10609
% 72.40/12.39 % Other redundant clauses eliminated : 1097
% 72.40/12.39 % Clauses deleted for lack of memory : 0
% 72.40/12.39 % Backward-subsumed : 63
% 72.40/12.39 % Backward-rewritten : 232
% 72.40/12.39 % Generated clauses : 180838
% 72.40/12.39 % ...of the previous two non-redundant : 170544
% 72.40/12.39 % ...aggressively subsumed : 0
% 72.40/12.39 % Contextual simplify-reflections : 26
% 72.40/12.39 % Paramodulations : 179749
% 72.40/12.39 % Factorizations : 10
% 72.40/12.39 % NegExts : 0
% 72.40/12.39 % Equation resolutions : 1145
% 72.40/12.39 % Disequality decompositions : 0
% 72.40/12.39 % Total rewrite steps : 51419
% 72.40/12.39 % ...of those cached : 40247
% 72.40/12.39 % Propositional unsat checks : 3
% 72.40/12.39 % Propositional check models : 2
% 72.40/12.39 % Propositional check unsatisfiable : 0
% 72.40/12.39 % Propositional clauses : 0
% 72.40/12.39 % Propositional clauses after purity: 0
% 72.40/12.39 % Propositional unsat core size : 0
% 72.40/12.39 % Propositional preprocessing time : 0.000
% 72.40/12.39 % Propositional encoding time : 0.615
% 72.40/12.39 % Propositional solver time : 0.297
% 72.40/12.39 % Success case prop preproc time : 0.000
% 72.40/12.39 % Success case prop encoding time : 0.000
% 72.40/12.39 % Success case prop solver time : 0.000
% 72.40/12.39 % Current number of processed clauses : 3869
% 72.40/12.39 % Positive orientable unit clauses : 1105
% 72.40/12.39 % Positive unorientable unit clauses: 29
% 72.40/12.39 % Negative unit clauses : 148
% 72.40/12.39 % Non-unit-clauses : 2587
% 72.40/12.39 % Current number of unprocessed clauses: 166246
% 72.40/12.39 % ...number of literals in the above : 499422
% 72.40/12.39 % Current number of archived formulas : 0
% 72.40/12.39 % Current number of archived clauses : 6279
% 72.40/12.39 % Clause-clause subsumption calls (NU) : 4460784
% 72.40/12.39 % Rec. Clause-clause subsumption calls : 1965795
% 72.40/12.39 % Non-unit clause-clause subsumptions : 1560
% 72.40/12.39 % Unit Clause-clause subsumption calls : 26653
% 72.40/12.39 % Rewrite failures with RHS unbound : 0
% 72.40/12.39 % BW rewrite match attempts : 38618
% 72.40/12.39 % BW rewrite match successes : 636
% 72.40/12.39 % Condensation attempts : 0
% 72.40/12.39 % Condensation successes : 0
% 72.40/12.39 % Termbank termtop insertions : 6848514
% 72.40/12.39 % Search garbage collected termcells : 102629
% 72.40/12.39
% 72.40/12.39 % -------------------------------------------------
% 72.40/12.39 % User time : 11.016 s
% 72.40/12.39 % System time : 0.349 s
% 72.40/12.39 % Total time : 11.366 s
% 72.40/12.39 % Maximum resident set size: 42592 pages
% 72.40/12.39
% 72.40/12.39 % -------------------------------------------------
% 72.40/12.39 % User time : 48.258 s
% 72.40/12.39 % System time : 1.414 s
% 72.40/12.39 % Total time : 49.673 s
% 72.40/12.39 % Maximum resident set size: 12288 pages
% 72.40/12.39 % E exiting
%------------------------------------------------------------------------------