%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP005-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:53:49 PM UTC 2026
% Result : Unsatisfiable 0.14s 5.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 41 ( 7 unt; 2 nHn; 39 RR)
% Number of literals : 111 ( 0 equ; 72 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 92 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(topology_generated_41,axiom,
( ~ subset_sets(X3,X1)
| ~ element_of_collection(X3,X2)
| ~ element_of_set(f11(X2,X1),X3)
| element_of_collection(X1,top_of_basis(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',topology_generated_41) ).
cnf(topology_generated_37,axiom,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| element_of_set(X3,f10(X2,X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',topology_generated_37) ).
cnf(set_theory_20,axiom,
( ~ element_of_collection(X2,X3)
| ~ subset_sets(X1,X2)
| subset_sets(X1,union_of_members(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_theory_20) ).
cnf(topology_generated_39,axiom,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| subset_sets(f10(X2,X1,X3),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',topology_generated_39) ).
cnf(topology_generated_38,axiom,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| element_of_collection(f10(X2,X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',topology_generated_38) ).
cnf(union_of_members_1,axiom,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_set(X1,f1(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_of_members_1) ).
cnf(set_theory_21,axiom,
( ~ element_of_collection(X3,X1)
| ~ subset_collections(X1,X2)
| element_of_collection(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_theory_21) ).
cnf(lemma_1e_2,negated_conjecture,
subset_collections(g,top_of_basis(f)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1e_2) ).
cnf(union_of_members_2,axiom,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_collection(f1(X2,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_of_members_2) ).
cnf(lemma_1e_3,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1e_3) ).
cnf(topology_generated_40,axiom,
( element_of_set(f11(X2,X1),X1)
| element_of_collection(X1,top_of_basis(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',topology_generated_40) ).
cnf(c_0_11,plain,
( ~ subset_sets(X3,X1)
| ~ element_of_collection(X3,X2)
| ~ element_of_set(f11(X2,X1),X3)
| element_of_collection(X1,top_of_basis(X2)) ),
inference(fof_simplification,[status(thm)],[topology_generated_41]) ).
cnf(c_0_12,plain,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| element_of_set(X3,f10(X2,X1,X3)) ),
inference(fof_simplification,[status(thm)],[topology_generated_37]) ).
cnf(c_0_13,plain,
( ~ element_of_collection(X2,X3)
| ~ subset_sets(X1,X2)
| subset_sets(X1,union_of_members(X3)) ),
inference(fof_simplification,[status(thm)],[set_theory_20]) ).
cnf(c_0_14,plain,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| subset_sets(f10(X2,X1,X3),X1) ),
inference(fof_simplification,[status(thm)],[topology_generated_39]) ).
cnf(c_0_15,plain,
( ~ subset_sets(X3,X1)
| ~ element_of_collection(X3,X2)
| ~ element_of_set(f11(X2,X1),X3)
| element_of_collection(X1,top_of_basis(X2)) ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| element_of_set(X3,f10(X2,X1,X3)) ),
c_0_12 ).
cnf(c_0_17,plain,
( ~ element_of_collection(X2,X3)
| ~ subset_sets(X1,X2)
| subset_sets(X1,union_of_members(X3)) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| subset_sets(f10(X2,X1,X3),X1) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ element_of_set(f11(X2,X1),X4)
| ~ element_of_collection(X4,top_of_basis(X3))
| ~ element_of_collection(f10(X3,X4,f11(X2,X1)),X2)
| ~ subset_sets(f10(X3,X4,f11(X2,X1)),X1)
| element_of_collection(X1,top_of_basis(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,X4)
| ~ element_of_collection(X2,top_of_basis(X1))
| subset_sets(f10(X1,X2,X3),union_of_members(X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| element_of_collection(f10(X2,X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[topology_generated_38]) ).
cnf(c_0_22,plain,
( ~ element_of_set(f11(X2,union_of_members(X1)),X4)
| ~ element_of_collection(X4,X1)
| ~ element_of_collection(X4,top_of_basis(X3))
| ~ element_of_collection(f10(X3,X4,f11(X2,union_of_members(X1))),X2)
| element_of_collection(union_of_members(X1),top_of_basis(X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,top_of_basis(X2))
| element_of_collection(f10(X2,X1,X3),X2) ),
c_0_21 ).
cnf(c_0_24,plain,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_set(X1,f1(X2,X1)) ),
inference(fof_simplification,[status(thm)],[union_of_members_1]) ).
cnf(c_0_25,plain,
( ~ element_of_collection(X3,X1)
| ~ subset_collections(X1,X2)
| element_of_collection(X3,X2) ),
inference(fof_simplification,[status(thm)],[set_theory_21]) ).
cnf(c_0_26,plain,
( ~ element_of_set(f11(X2,union_of_members(X1)),X3)
| ~ element_of_collection(X3,X1)
| ~ element_of_collection(X3,top_of_basis(X2))
| element_of_collection(union_of_members(X1),top_of_basis(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_set(X1,f1(X2,X1)) ),
c_0_24 ).
cnf(c_0_28,plain,
( ~ element_of_collection(X3,X1)
| ~ subset_collections(X1,X2)
| element_of_collection(X3,X2) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
subset_collections(g,top_of_basis(f)),
lemma_1e_2 ).
cnf(c_0_30,plain,
( ~ element_of_set(f11(X2,union_of_members(X1)),union_of_members(X3))
| ~ element_of_collection(f1(X3,f11(X2,union_of_members(X1))),X1)
| ~ element_of_collection(f1(X3,f11(X2,union_of_members(X1))),top_of_basis(X2))
| element_of_collection(union_of_members(X1),top_of_basis(X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( ~ element_of_collection(X1,g)
| element_of_collection(X1,top_of_basis(f)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_collection(f1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[union_of_members_2]) ).
cnf(c_0_33,negated_conjecture,
( ~ element_of_set(f11(f,union_of_members(X1)),union_of_members(X2))
| ~ element_of_collection(f1(X2,f11(f,union_of_members(X1))),X1)
| ~ element_of_collection(f1(X2,f11(f,union_of_members(X1))),g)
| element_of_collection(union_of_members(X1),top_of_basis(f)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_collection(f1(X2,X1),X2) ),
c_0_32 ).
cnf(c_0_35,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
inference(fof_simplification,[status(thm)],[lemma_1e_3]) ).
cnf(c_0_36,negated_conjecture,
( ~ element_of_set(f11(f,union_of_members(X1)),union_of_members(g))
| ~ element_of_collection(f1(g,f11(f,union_of_members(X1))),X1)
| element_of_collection(union_of_members(X1),top_of_basis(f)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
~ element_of_set(f11(f,union_of_members(g)),union_of_members(g)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_34]),c_0_37]) ).
cnf(c_0_39,axiom,
( element_of_set(f11(X2,X1),X1)
| element_of_collection(X1,top_of_basis(X2)) ),
topology_generated_40 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : TOP005-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n003.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 12:39:51 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 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.14/5.47 % Version: 3.5.1
% 0.14/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.47 % Starting sh5l with 300s (1) cores
% 0.14/5.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 101740 completed with status 0
% 0.14/5.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.47 % No SInE strategy applied
% 0.14/5.47 % Search class: FGUNF-FFSF31-SFFFFFNN
% 0.14/5.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/5.47 % Starting new_bool_3 with 136s (1) cores
% 0.14/5.47 % Starting new_bool_1 with 136s (1) cores
% 0.14/5.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 101745 completed with status 0
% 0.14/5.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.47 % No SInE strategy applied
% 0.14/5.47 % Search class: FGUNF-FFSF31-SFFFFFNN
% 0.14/5.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.47 % Preprocessing time : 0.001 s
% 0.14/5.47 % Presaturation interreduction done
% 0.14/5.47
% 0.14/5.47 % Proof found!
% 0.14/5.47 % SZS status Unsatisfiable
% 0.14/5.47 % SZS output start CNFRefutation
% See solution above
% 0.14/5.47 % Parsed axioms : 12
% 0.14/5.47 % Removed by relevancy pruning/SinE : 0
% 0.14/5.47 % Initial clauses : 12
% 0.14/5.47 % Removed in clause preprocessing : 0
% 0.14/5.47 % Initial clauses in saturation : 12
% 0.14/5.47 % Processed clauses : 208
% 0.14/5.47 % ...of these trivial : 0
% 0.14/5.47 % ...subsumed : 31
% 0.14/5.47 % ...remaining for further processing : 177
% 0.14/5.47 % Other redundant clauses eliminated : 0
% 0.14/5.47 % Clauses deleted for lack of memory : 0
% 0.14/5.47 % Backward-subsumed : 1
% 0.14/5.47 % Backward-rewritten : 1
% 0.14/5.47 % Generated clauses : 836
% 0.14/5.47 % ...of the previous two non-redundant : 823
% 0.14/5.47 % ...aggressively subsumed : 0
% 0.14/5.47 % Contextual simplify-reflections : 8
% 0.14/5.47 % Paramodulations : 832
% 0.14/5.47 % Factorizations : 4
% 0.14/5.47 % NegExts : 0
% 0.14/5.47 % Equation resolutions : 0
% 0.14/5.47 % Disequality decompositions : 0
% 0.14/5.47 % Total rewrite steps : 9
% 0.14/5.47 % ...of those cached : 4
% 0.14/5.47 % Propositional unsat checks : 0
% 0.14/5.47 % Propositional check models : 0
% 0.14/5.47 % Propositional check unsatisfiable : 0
% 0.14/5.47 % Propositional clauses : 0
% 0.14/5.47 % Propositional clauses after purity: 0
% 0.14/5.47 % Propositional unsat core size : 0
% 0.14/5.47 % Propositional preprocessing time : 0.000
% 0.14/5.47 % Propositional encoding time : 0.000
% 0.14/5.47 % Propositional solver time : 0.000
% 0.14/5.47 % Success case prop preproc time : 0.000
% 0.14/5.47 % Success case prop encoding time : 0.000
% 0.14/5.47 % Success case prop solver time : 0.000
% 0.14/5.47 % Current number of processed clauses : 163
% 0.14/5.47 % Positive orientable unit clauses : 2
% 0.14/5.47 % Positive unorientable unit clauses: 0
% 0.14/5.47 % Negative unit clauses : 3
% 0.14/5.47 % Non-unit-clauses : 158
% 0.14/5.47 % Current number of unprocessed clauses: 639
% 0.14/5.47 % ...number of literals in the above : 2901
% 0.14/5.47 % Current number of archived formulas : 0
% 0.14/5.47 % Current number of archived clauses : 14
% 0.14/5.47 % Clause-clause subsumption calls (NU) : 2626
% 0.14/5.47 % Rec. Clause-clause subsumption calls : 1639
% 0.14/5.47 % Non-unit clause-clause subsumptions : 34
% 0.14/5.47 % Unit Clause-clause subsumption calls : 39
% 0.14/5.47 % Rewrite failures with RHS unbound : 0
% 0.14/5.47 % BW rewrite match attempts : 10
% 0.14/5.47 % BW rewrite match successes : 1
% 0.14/5.47 % Condensation attempts : 0
% 0.14/5.47 % Condensation successes : 0
% 0.14/5.47 % Termbank termtop insertions : 21100
% 0.14/5.47 % Search garbage collected termcells : 35
% 0.14/5.47
% 0.14/5.47 % -------------------------------------------------
% 0.14/5.47 % User time : 0.030 s
% 0.14/5.47 % System time : 0.007 s
% 0.14/5.47 % Total time : 0.037 s
% 0.14/5.47 % Maximum resident set size: 3640 pages
% 0.14/5.47
% 0.14/5.47 % -------------------------------------------------
% 0.14/5.47 % User time : 0.160 s
% 0.14/5.47 % System time : 0.021 s
% 0.14/5.47 % Total time : 0.181 s
% 0.14/5.47 % Maximum resident set size: 4608 pages
% 0.14/5.47 % E exiting
%------------------------------------------------------------------------------