%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT010-4 : 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 : n013.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:00 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 19 unt; 0 nHn; 25 RR)
% Number of literals : 47 ( 21 equ; 17 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain_codomain_composition1,axiom,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_codomain_composition1) ).
cnf(domain_has_elements,axiom,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_has_elements) ).
cnf(ab_exists,hypothesis,
there_exists(compose(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_exists) ).
cnf(composition_implies_domain,axiom,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',composition_implies_domain) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',compose_codomain) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-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/CAT004-0.ax',associativity_of_compose) ).
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_8,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
inference(fof_simplification,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_0_9,plain,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
inference(fof_simplification,[status(thm)],[domain_has_elements]) ).
cnf(c_0_10,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
c_0_8 ).
cnf(c_0_11,hypothesis,
there_exists(compose(a,b)),
ab_exists ).
cnf(c_0_12,plain,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
inference(fof_simplification,[status(thm)],[composition_implies_domain]) ).
cnf(c_0_13,plain,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
c_0_9 ).
cnf(c_0_14,hypothesis,
domain(a) = codomain(b),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
c_0_12 ).
cnf(c_0_16,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_17,hypothesis,
( ~ there_exists(codomain(b))
| there_exists(a) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
there_exists(codomain(b)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_14]) ).
cnf(c_0_19,plain,
( ~ there_exists(X1)
| domain(codomain(X1)) = codomain(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,hypothesis,
there_exists(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_22,hypothesis,
domain(codomain(a)) = codomain(a),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
associativity_of_compose ).
cnf(c_0_24,hypothesis,
compose(codomain(a),codomain(a)) = codomain(a),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ there_exists(compose(X2,compose(X3,X1)))
| codomain(X1) = domain(compose(X2,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_26,hypothesis,
compose(codomain(a),compose(codomain(a),X1)) = compose(codomain(a),X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,hypothesis,
( ~ there_exists(compose(codomain(a),X1))
| codomain(X1) = codomain(a) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]),c_0_22]) ).
cnf(c_0_28,plain,
compose(codomain(X1),compose(X1,X2)) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
inference(fof_simplification,[status(thm)],[prove_codomain_of_ab_equals_codomain_of_a]) ).
cnf(c_0_30,hypothesis,
( ~ there_exists(compose(a,X1))
| codomain(compose(a,X1)) = codomain(a) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
c_0_29 ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_11]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CAT010-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 13:55:36 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 927984 completed with status 0
% 0.14/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FHUSS-FFSF21-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S064A with 136s (1) cores
% 0.14/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.43 % G-E--_208_B00_00_F1_SE_CS_SP_PS_S064A with pid 927994 completed with status 0
% 0.14/0.43 % Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S064A
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FHUSS-FFSF21-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S064A with 136s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43 % Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 13
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 13
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 13
% 0.14/0.43 % Processed clauses : 112
% 0.14/0.43 % ...of these trivial : 12
% 0.14/0.43 % ...subsumed : 10
% 0.14/0.43 % ...remaining for further processing : 90
% 0.14/0.43 % Other redundant clauses eliminated : 1
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 0
% 0.14/0.43 % Backward-rewritten : 7
% 0.14/0.43 % Generated clauses : 349
% 0.14/0.43 % ...of the previous two non-redundant : 204
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 347
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 2
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 423
% 0.14/0.43 % ...of those cached : 354
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 69
% 0.14/0.43 % Positive orientable unit clauses : 40
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 1
% 0.14/0.43 % Non-unit-clauses : 28
% 0.14/0.43 % Current number of unprocessed clauses: 115
% 0.14/0.43 % ...number of literals in the above : 194
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 20
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 54
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 54
% 0.14/0.43 % Non-unit clause-clause subsumptions : 10
% 0.14/0.43 % Unit Clause-clause subsumption calls : 0
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 9
% 0.14/0.43 % BW rewrite match successes : 6
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 4136
% 0.14/0.43 % Search garbage collected termcells : 20
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.006 s
% 0.14/0.43 % System time : 0.006 s
% 0.14/0.43 % Total time : 0.012 s
% 0.14/0.43 % Maximum resident set size: 3640 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.040 s
% 0.14/0.43 % System time : 0.015 s
% 0.14/0.43 % Total time : 0.056 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------