%------------------------------------------------------------------------------
% File : E-SAT---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 : n002.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:17 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 19 unt; 0 nHn; 29 RR)
% Number of literals : 52 ( 16 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 33 ( 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(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(assume_ab_exists,hypothesis,
there_exists(compose(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_ab_exists) ).
cnf(domain_has_elements,axiom,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_has_elements) ).
cnf(assume_bc_exists,hypothesis,
there_exists(compose(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_bc_exists) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_codomain) ).
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(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(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,plain,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
inference(fof_simplification,[status(thm)],[composition_implies_domain]) ).
cnf(c_0_11,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
c_0_9 ).
cnf(c_0_12,hypothesis,
there_exists(compose(a,b)),
assume_ab_exists ).
cnf(c_0_13,plain,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
inference(fof_simplification,[status(thm)],[domain_has_elements]) ).
cnf(c_0_14,plain,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
c_0_10 ).
cnf(c_0_15,hypothesis,
there_exists(compose(b,c)),
assume_bc_exists ).
cnf(c_0_16,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_17,hypothesis,
codomain(b) = domain(a),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
c_0_13 ).
cnf(c_0_19,hypothesis,
there_exists(domain(b)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,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_21,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
associativity_of_compose ).
cnf(c_0_22,hypothesis,
compose(domain(a),b) = b,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,hypothesis,
there_exists(b),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( domain(X1) != codomain(X2)
| ~ there_exists(domain(X1))
| there_exists(compose(X1,X2)) ),
c_0_20 ).
cnf(c_0_25,hypothesis,
there_exists(domain(a)),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_26,hypothesis,
compose(domain(a),compose(b,X1)) = compose(b,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
domain(domain(a)) = domain(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_22]),c_0_17]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
~ there_exists(compose(a,compose(b,c))),
inference(fof_simplification,[status(thm)],[prove_a_bc_exists]) ).
cnf(c_0_29,hypothesis,
( codomain(X1) != domain(a)
| there_exists(compose(a,X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,hypothesis,
( ~ there_exists(compose(b,X1))
| codomain(compose(b,X1)) = domain(a) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_26]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ there_exists(compose(a,compose(b,c))),
c_0_28 ).
cnf(c_0_32,hypothesis,
( ~ there_exists(compose(b,X1))
| there_exists(compose(a,compose(b,X1))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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.11/0.36 % Computer : n002.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 13:59:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3456117 completed with status 0
% 0.14/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGUSS-FFSF21-SFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3456123 completed with status 0
% 0.14/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGUSS-FFSF21-SFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.47 % Preprocessing time : 0.001 s
% 0.14/0.47 % Presaturation interreduction done
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Unsatisfiable
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 20
% 0.14/0.47 % Removed by relevancy pruning/SinE : 0
% 0.14/0.47 % Initial clauses : 20
% 0.14/0.47 % Removed in clause preprocessing : 1
% 0.14/0.47 % Initial clauses in saturation : 19
% 0.14/0.47 % Processed clauses : 376
% 0.14/0.47 % ...of these trivial : 11
% 0.14/0.47 % ...subsumed : 192
% 0.14/0.47 % ...remaining for further processing : 173
% 0.14/0.47 % Other redundant clauses eliminated : 76
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 6
% 0.14/0.47 % Backward-rewritten : 10
% 0.14/0.47 % Generated clauses : 2177
% 0.14/0.47 % ...of the previous two non-redundant : 1238
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 1
% 0.14/0.47 % Paramodulations : 2094
% 0.14/0.47 % Factorizations : 6
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 77
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 1694
% 0.14/0.47 % ...of those cached : 1511
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 137
% 0.14/0.47 % Positive orientable unit clauses : 38
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 2
% 0.14/0.47 % Non-unit-clauses : 97
% 0.14/0.47 % Current number of unprocessed clauses: 872
% 0.14/0.47 % ...number of literals in the above : 2259
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 34
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 952
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 944
% 0.14/0.47 % Non-unit clause-clause subsumptions : 176
% 0.14/0.47 % Unit Clause-clause subsumption calls : 25
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 25
% 0.14/0.47 % BW rewrite match successes : 8
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 22520
% 0.14/0.47 % Search garbage collected termcells : 28
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.020 s
% 0.14/0.47 % System time : 0.007 s
% 0.14/0.47 % Total time : 0.027 s
% 0.14/0.47 % Maximum resident set size: 3336 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.086 s
% 0.14/0.47 % System time : 0.027 s
% 0.14/0.47 % Total time : 0.114 s
% 0.14/0.47 % Maximum resident set size: 4608 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------