%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CAT010-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 12:08:14 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 15 RR)
% Number of literals : 38 ( 37 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 43 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain_codomain_composition1,axiom,
ifeq2(there_exists(compose(X1,X2)),true,domain(X1),codomain(X2)) = codomain(X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_codomain_composition1) ).
cnf(ab_exists,hypothesis,
there_exists(compose(a,b)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_exists) ).
cnf(ifeq_axiom_001,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_domain) ).
cnf(associativity_of_compose,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_compose) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_codomain) ).
cnf(composition_implies_domain,axiom,
ifeq(there_exists(compose(X1,X2)),true,there_exists(domain(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composition_implies_domain) ).
cnf(ifeq_axiom_002,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(domain_has_elements,axiom,
ifeq(there_exists(domain(X1)),true,there_exists(X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_has_elements) ).
cnf(prove_codomain_of_ab_equals_codomain_of_a,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_ab_equals_codomain_of_a) ).
cnf(c_0_10,axiom,
ifeq2(there_exists(compose(X1,X2)),true,domain(X1),codomain(X2)) = codomain(X2),
domain_codomain_composition1 ).
cnf(c_0_11,hypothesis,
there_exists(compose(a,b)) = true,
ab_exists ).
cnf(c_0_12,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_13,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_14,hypothesis,
domain(a) = codomain(b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
associativity_of_compose ).
cnf(c_0_16,hypothesis,
compose(a,codomain(b)) = a,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
compose(a,compose(codomain(b),X1)) = compose(a,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,hypothesis,
compose(a,domain(codomain(b))) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_16]) ).
cnf(c_0_19,plain,
compose(X1,compose(domain(X1),X2)) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,hypothesis,
compose(a,compose(domain(codomain(b)),X1)) = compose(a,X1),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_21,plain,
compose(X1,domain(domain(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_13]) ).
cnf(c_0_22,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_23,plain,
compose(X1,compose(X2,domain(compose(X1,X2)))) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_24,hypothesis,
compose(a,domain(domain(domain(codomain(b))))) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]) ).
cnf(c_0_25,axiom,
ifeq(there_exists(compose(X1,X2)),true,there_exists(domain(X1)),true) = true,
composition_implies_domain ).
cnf(c_0_26,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_002 ).
cnf(c_0_27,plain,
compose(codomain(X1),compose(X1,X2)) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_28,hypothesis,
compose(a,compose(domain(domain(domain(codomain(b)))),codomain(b))) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]) ).
cnf(c_0_29,axiom,
ifeq(there_exists(domain(X1)),true,there_exists(X1),true) = true,
domain_has_elements ).
cnf(c_0_30,hypothesis,
there_exists(codomain(b)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_11]),c_0_14]),c_0_26]) ).
cnf(c_0_31,plain,
ifeq2(there_exists(compose(X1,X2)),true,domain(codomain(X1)),codomain(compose(X1,X2))) = codomain(compose(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_27]) ).
cnf(c_0_32,hypothesis,
compose(a,compose(domain(domain(domain(codomain(b)))),compose(codomain(b),codomain(b)))) = a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_14]),c_0_15]) ).
cnf(c_0_33,hypothesis,
there_exists(a) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_14]),c_0_30]),c_0_26]) ).
cnf(c_0_34,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
inference(fof_simplification,[status(thm)],[prove_codomain_of_ab_equals_codomain_of_a]) ).
cnf(c_0_35,hypothesis,
domain(codomain(a)) = codomain(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_12]) ).
cnf(c_0_36,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
c_0_34 ).
cnf(c_0_37,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_11]),c_0_12]),c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT010-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 13:55:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3303174 completed with status 0
% 0.15/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FUUPM-FFSF32-MFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/0.44 % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/0.44 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.15/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3303180 completed with status 0
% 0.15/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FUUPM-FFSF32-MFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44 % Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Unsatisfiable
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 16
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 16
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 16
% 0.15/0.44 % Processed clauses : 181
% 0.15/0.44 % ...of these trivial : 62
% 0.15/0.44 % ...subsumed : 0
% 0.15/0.44 % ...remaining for further processing : 118
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 0
% 0.15/0.44 % Backward-rewritten : 12
% 0.15/0.44 % Generated clauses : 1142
% 0.15/0.44 % ...of the previous two non-redundant : 662
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 0
% 0.15/0.44 % Paramodulations : 1142
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 1760
% 0.15/0.44 % ...of those cached : 1491
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 90
% 0.15/0.44 % Positive orientable unit clauses : 89
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 1
% 0.15/0.44 % Non-unit-clauses : 0
% 0.15/0.44 % Current number of unprocessed clauses: 508
% 0.15/0.44 % ...number of literals in the above : 508
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 28
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.44 % Non-unit clause-clause subsumptions : 0
% 0.15/0.44 % Unit Clause-clause subsumption calls : 0
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 183
% 0.15/0.44 % BW rewrite match successes : 8
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 15115
% 0.15/0.44 % Search garbage collected termcells : 2
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.011 s
% 0.15/0.44 % System time : 0.001 s
% 0.15/0.44 % Total time : 0.012 s
% 0.15/0.44 % Maximum resident set size: 3588 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.035 s
% 0.15/0.44 % System time : 0.013 s
% 0.15/0.44 % Total time : 0.048 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------