%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP003-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 : Satisfiable 0.14s 0.50s
% Output : Saturation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_19ERROR: Could not build tree for root c_0_41ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_13,plain,
( ~ subset_sets(X3,X1)
| ~ equal_sets(X1,X2)
| subset_sets(X3,X2) ),
c_0_11,
[final] ).
cnf(c_0_14,plain,
( ~ basis(X1,X2)
| equal_sets(union_of_members(X2),X1) ),
c_0_12,
[final] ).
cnf(c_0_16,plain,
( ~ basis(X2,X3)
| ~ subset_sets(X1,union_of_members(X3))
| subset_sets(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]),
[final] ).
cnf(c_0_17,plain,
( ~ element_of_collection(X1,X2)
| subset_sets(X1,union_of_members(X2)) ),
c_0_15,
[final] ).
cnf(c_0_20,plain,
( ~ element_of_collection(X1,X3)
| ~ basis(X2,X3)
| subset_sets(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]),
[final] ).
cnf(c_0_21,negated_conjecture,
basis(cx,f),
lemma_1c_1,
[final] ).
cnf(c_0_23,axiom,
subset_sets(X1,X1),
set_theory_9,
[final] ).
cnf(c_0_24,plain,
( ~ subset_sets(X1,X3)
| ~ equal_sets(X1,X2)
| subset_sets(X2,X3) ),
c_0_18,
[final] ).
cnf(c_0_25,plain,
( ~ element_of_set(X3,X1)
| ~ subset_sets(X1,X2)
| element_of_set(X3,X2) ),
c_0_19,
[final] ).
cnf(c_0_26,negated_conjecture,
( ~ element_of_collection(X1,f)
| subset_sets(X1,cx) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[final] ).
cnf(c_0_27,plain,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_collection(f1(X2,X1),X2) ),
c_0_22,
[final] ).
cnf(c_0_28,plain,
( ~ basis(X2,X1)
| subset_sets(union_of_members(X1),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]),
[final] ).
cnf(c_0_29,plain,
( ~ basis(X1,X3)
| ~ subset_sets(union_of_members(X3),X2)
| subset_sets(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]),
[final] ).
cnf(c_0_30,plain,
( ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,X2)
| element_of_set(X1,union_of_members(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]),
[final] ).
cnf(c_0_31,negated_conjecture,
( ~ element_of_set(X1,union_of_members(f))
| subset_sets(f1(f,X1),cx) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]),
[final] ).
cnf(c_0_32,negated_conjecture,
subset_sets(union_of_members(f),cx),
inference(spm,[status(thm)],[c_0_28,c_0_21]),
[final] ).
cnf(c_0_33,plain,
( ~ basis(X1,X2)
| subset_sets(X1,union_of_members(X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_23]),
[final] ).
cnf(c_0_34,plain,
( ~ element_of_set(X3,union_of_members(X2))
| ~ element_of_set(X1,f1(X2,X3))
| element_of_set(X1,union_of_members(X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_27]),
[final] ).
cnf(c_0_35,axiom,
( element_of_set(f11(X2,X1),X1)
| element_of_collection(X1,top_of_basis(X2)) ),
topology_generated_40,
[final] ).
cnf(c_0_36,negated_conjecture,
( ~ element_of_set(X2,union_of_members(f))
| ~ element_of_set(X1,f1(f,X2))
| element_of_set(X1,cx) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]),
[final] ).
cnf(c_0_37,negated_conjecture,
( ~ element_of_set(X1,union_of_members(f))
| element_of_set(X1,cx) ),
inference(spm,[status(thm)],[c_0_25,c_0_32]),
[final] ).
cnf(c_0_38,negated_conjecture,
subset_sets(cx,union_of_members(f)),
inference(spm,[status(thm)],[c_0_33,c_0_21]),
[final] ).
cnf(c_0_41,plain,
( ~ element_of_set(X2,union_of_members(X1))
| element_of_set(f11(X3,f1(X1,X2)),union_of_members(X1))
| element_of_collection(f1(X1,X2),top_of_basis(X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_42,negated_conjecture,
( ~ element_of_set(X1,union_of_members(f))
| element_of_set(f11(X2,f1(f,X1)),cx)
| element_of_collection(f1(f,X1),top_of_basis(X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]),
[final] ).
cnf(c_0_43,plain,
( ~ element_of_collection(union_of_members(X3),X2)
| ~ basis(X1,X3)
| subset_sets(X1,union_of_members(X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_17]),
[final] ).
cnf(c_0_44,negated_conjecture,
( element_of_set(f11(X1,union_of_members(f)),cx)
| element_of_collection(union_of_members(f),top_of_basis(X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_35]),
[final] ).
cnf(c_0_45,negated_conjecture,
( ~ element_of_set(X1,cx)
| element_of_set(X1,union_of_members(f)) ),
inference(spm,[status(thm)],[c_0_25,c_0_38]),
[final] ).
cnf(c_0_46,negated_conjecture,
( ~ basis(X1,f)
| subset_sets(cx,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_38]),
[final] ).
cnf(c_0_47,negated_conjecture,
( ~ basis(X1,f)
| subset_sets(X1,cx) ),
inference(spm,[status(thm)],[c_0_29,c_0_32]),
[final] ).
cnf(c_0_48,plain,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_set(X1,f1(X2,X1)) ),
c_0_39,
[final] ).
cnf(c_0_49,negated_conjecture,
~ element_of_collection(cx,top_of_basis(f)),
c_0_40,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : TOP003-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n015.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 12:41:22 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/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
% 0.14/0.50 % Version: 3.5.1
% 0.14/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1467682 completed with status 1
% 0.14/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50 % No SInE strategy applied
% 0.14/0.50 % Search class: FGUNF-FFSF21-SFFFFFNN
% 0.14/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.50 % SubtermCWHack with pid 1467686 completed with status 1
% 0.14/0.50 % Result found by SubtermCWHack
% 0.14/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50 % No SInE strategy applied
% 0.14/0.50 % Search class: FGUNF-FFSF21-SFFFFFNN
% 0.14/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50 % Preprocessing time : 0.002 s
% 0.14/0.50
% 0.14/0.50 % No proof found!
% 0.14/0.50 % SZS status Satisfiable
% 0.14/0.50 % SZS output start Saturation
% See solution above
% 0.14/0.50 % Parsed axioms : 11
% 0.14/0.50 % Removed by relevancy pruning/SinE : 0
% 0.14/0.50 % Initial clauses : 11
% 0.14/0.50 % Removed in clause preprocessing : 0
% 0.14/0.50 % Initial clauses in saturation : 11
% 0.14/0.50 % Processed clauses : 33
% 0.14/0.50 % ...of these trivial : 0
% 0.14/0.50 % ...subsumed : 2
% 0.14/0.50 % ...remaining for further processing : 31
% 0.14/0.50 % Other redundant clauses eliminated : 0
% 0.14/0.50 % Clauses deleted for lack of memory : 0
% 0.14/0.50 % Backward-subsumed : 0
% 0.14/0.50 % Backward-rewritten : 0
% 0.14/0.50 % Generated clauses : 27
% 0.14/0.50 % ...of the previous two non-redundant : 22
% 0.14/0.50 % ...aggressively subsumed : 0
% 0.14/0.50 % Contextual simplify-reflections : 0
% 0.14/0.50 % Paramodulations : 27
% 0.14/0.50 % Factorizations : 0
% 0.14/0.50 % NegExts : 0
% 0.14/0.50 % Equation resolutions : 0
% 0.14/0.50 % Disequality decompositions : 0
% 0.14/0.50 % Total rewrite steps : 2
% 0.14/0.50 % ...of those cached : 1
% 0.14/0.50 % Propositional unsat checks : 0
% 0.14/0.50 % Propositional check models : 0
% 0.14/0.50 % Propositional check unsatisfiable : 0
% 0.14/0.50 % Propositional clauses : 0
% 0.14/0.50 % Propositional clauses after purity: 0
% 0.14/0.50 % Propositional unsat core size : 0
% 0.14/0.50 % Propositional preprocessing time : 0.000
% 0.14/0.50 % Propositional encoding time : 0.000
% 0.14/0.50 % Propositional solver time : 0.000
% 0.14/0.50 % Success case prop preproc time : 0.000
% 0.14/0.50 % Success case prop encoding time : 0.000
% 0.14/0.50 % Success case prop solver time : 0.000
% 0.14/0.50 % Current number of processed clauses : 31
% 0.14/0.50 % Positive orientable unit clauses : 4
% 0.14/0.50 % Positive unorientable unit clauses: 0
% 0.14/0.50 % Negative unit clauses : 1
% 0.14/0.50 % Non-unit-clauses : 26
% 0.14/0.50 % Current number of unprocessed clauses: 0
% 0.14/0.50 % ...number of literals in the above : 0
% 0.14/0.50 % Current number of archived formulas : 0
% 0.14/0.50 % Current number of archived clauses : 0
% 0.14/0.50 % Clause-clause subsumption calls (NU) : 89
% 0.14/0.50 % Rec. Clause-clause subsumption calls : 84
% 0.14/0.50 % Non-unit clause-clause subsumptions : 2
% 0.14/0.50 % Unit Clause-clause subsumption calls : 5
% 0.14/0.50 % Rewrite failures with RHS unbound : 0
% 0.14/0.50 % BW rewrite match attempts : 0
% 0.14/0.50 % BW rewrite match successes : 0
% 0.14/0.50 % Condensation attempts : 0
% 0.14/0.50 % Condensation successes : 0
% 0.14/0.50 % Termbank termtop insertions : 748
% 0.14/0.50 % Search garbage collected termcells : 28
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.007 s
% 0.14/0.50 % System time : 0.004 s
% 0.14/0.50 % Total time : 0.011 s
% 0.14/0.50 % Maximum resident set size: 3380 pages
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.060 s
% 0.14/0.50 % System time : 0.020 s
% 0.14/0.50 % Total time : 0.080 s
% 0.14/0.50 % Maximum resident set size: 4864 pages
% 0.14/0.50 % E exiting
%------------------------------------------------------------------------------