%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT018-3 : 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 : n014.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:03 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 35 ( 20 unt; 0 nHn; 30 RR)
% Number of literals : 54 ( 18 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain_codomain_composition1,axiom,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_domain) ).
cnf(associativity_of_compose,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',associativity_of_compose) ).
cnf(composition_implies_domain,axiom,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',composition_implies_domain) ).
cnf(codomain_has_elements,axiom,
( ~ there_exists(codomain(X1))
| there_exists(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',codomain_has_elements) ).
cnf(assume_ab_exists,hypothesis,
there_exists(compose(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_ab_exists) ).
cnf(domain_codomain_composition2,axiom,
( domain(X1) != codomain(X2)
| ~ there_exists(domain(X1))
| there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition2) ).
cnf(assume_bc_exists,hypothesis,
there_exists(compose(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_bc_exists) ).
cnf(prove_a_bc_exists,negated_conjecture,
~ there_exists(compose(a,compose(b,c))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_bc_exists) ).
cnf(c_0_9,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
inference(fof_simplification,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_0_10,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_11,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
associativity_of_compose ).
cnf(c_0_12,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
c_0_9 ).
cnf(c_0_13,plain,
compose(X1,compose(X2,domain(compose(X1,X2)))) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
inference(fof_simplification,[status(thm)],[composition_implies_domain]) ).
cnf(c_0_15,plain,
( ~ there_exists(codomain(X1))
| there_exists(X1) ),
inference(fof_simplification,[status(thm)],[codomain_has_elements]) ).
cnf(c_0_16,plain,
( ~ there_exists(compose(X2,X1))
| codomain(compose(X1,domain(compose(X2,X1)))) = domain(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
there_exists(compose(a,b)),
assume_ab_exists ).
cnf(c_0_18,plain,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ there_exists(codomain(X1))
| there_exists(X1) ),
c_0_15 ).
cnf(c_0_20,hypothesis,
codomain(compose(b,domain(compose(a,b)))) = domain(a),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,hypothesis,
there_exists(domain(a)),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,plain,
( domain(X1) != codomain(X2)
| ~ there_exists(domain(X1))
| there_exists(compose(X1,X2)) ),
inference(fof_simplification,[status(thm)],[domain_codomain_composition2]) ).
cnf(c_0_23,hypothesis,
there_exists(compose(b,c)),
assume_bc_exists ).
cnf(c_0_24,hypothesis,
there_exists(compose(b,domain(compose(a,b)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( domain(X1) != codomain(X2)
| ~ there_exists(domain(X1))
| there_exists(compose(X1,X2)) ),
c_0_22 ).
cnf(c_0_26,hypothesis,
codomain(c) = domain(b),
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_27,plain,
( ~ there_exists(X1)
| codomain(domain(X1)) = domain(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_28,hypothesis,
codomain(domain(compose(a,b))) = domain(b),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
~ there_exists(compose(a,compose(b,c))),
inference(fof_simplification,[status(thm)],[prove_a_bc_exists]) ).
cnf(c_0_30,hypothesis,
( ~ there_exists(domain(X1))
| domain(b) != domain(X1)
| there_exists(compose(X1,c)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,hypothesis,
domain(compose(a,b)) = domain(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17])]) ).
cnf(c_0_32,hypothesis,
there_exists(domain(b)),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_33,negated_conjecture,
~ there_exists(compose(a,compose(b,c))),
c_0_29 ).
cnf(c_0_34,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_11]),c_0_32])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CAT018-3 : 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.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 13:56:34 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 40262 completed with status 0
% 0.13/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGUSS-FFSF21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.44 % new_bool_3 with pid 40271 completed with status 0
% 0.13/0.44 % Result found by new_bool_3
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGUSS-FFSF21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.44 % Preprocessing time : 0.001 s
% 0.13/0.44 % Presaturation interreduction done
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Unsatisfiable
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 20
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 20
% 0.13/0.44 % Removed in clause preprocessing : 1
% 0.13/0.44 % Initial clauses in saturation : 19
% 0.13/0.44 % Processed clauses : 322
% 0.13/0.44 % ...of these trivial : 15
% 0.13/0.44 % ...subsumed : 133
% 0.13/0.44 % ...remaining for further processing : 174
% 0.13/0.44 % Other redundant clauses eliminated : 23
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 4
% 0.13/0.44 % Backward-rewritten : 13
% 0.13/0.44 % Generated clauses : 3255
% 0.13/0.44 % ...of the previous two non-redundant : 1680
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 0
% 0.13/0.44 % Paramodulations : 3224
% 0.13/0.44 % Factorizations : 4
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 27
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 2428
% 0.13/0.44 % ...of those cached : 2213
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 137
% 0.13/0.44 % Positive orientable unit clauses : 45
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 1
% 0.13/0.44 % Non-unit-clauses : 91
% 0.13/0.44 % Current number of unprocessed clauses: 1384
% 0.13/0.44 % ...number of literals in the above : 4205
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 35
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 681
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 617
% 0.13/0.44 % Non-unit clause-clause subsumptions : 125
% 0.13/0.44 % Unit Clause-clause subsumption calls : 70
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 29
% 0.13/0.44 % BW rewrite match successes : 10
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 33211
% 0.13/0.44 % Search garbage collected termcells : 28
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.020 s
% 0.13/0.44 % System time : 0.006 s
% 0.13/0.44 % Total time : 0.026 s
% 0.13/0.44 % Maximum resident set size: 3644 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.114 s
% 0.13/0.44 % System time : 0.019 s
% 0.13/0.44 % Total time : 0.133 s
% 0.13/0.44 % Maximum resident set size: 4864 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------