%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT018-1 : 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 : n007.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.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 16 unt; 0 nHn; 27 RR)
% Number of literals : 58 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(closure_of_composition,axiom,
( ~ defined(X1,X2)
| product(X1,X2,compose(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',closure_of_composition) ).
cnf(category_theory_axiom3,axiom,
( ~ defined(X4,X3)
| ~ product(X1,X2,X3)
| defined(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',category_theory_axiom3) ).
cnf(assume_bc_exists,hypothesis,
defined(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_bc_exists) ).
cnf(identity1,axiom,
( ~ identity_map(X1)
| ~ defined(X1,X2)
| product(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',identity1) ).
cnf(mapping_from_codomain_of_x_to_x,axiom,
defined(codomain(X1),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',mapping_from_codomain_of_x_to_x) ).
cnf(codomain_is_an_identity_map,axiom,
identity_map(codomain(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',codomain_is_an_identity_map) ).
cnf(category_theory_axiom6,axiom,
( ~ identity_map(X2)
| ~ defined(X2,X3)
| ~ defined(X1,X2)
| defined(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',category_theory_axiom6) ).
cnf(assume_ab_exists,hypothesis,
defined(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_ab_exists) ).
cnf(prove_a_bc_exists,negated_conjecture,
~ defined(a,compose(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_bc_exists) ).
cnf(c_0_9,plain,
( ~ defined(X1,X2)
| product(X1,X2,compose(X1,X2)) ),
inference(fof_simplification,[status(thm)],[closure_of_composition]) ).
cnf(c_0_10,plain,
( ~ defined(X4,X3)
| ~ product(X1,X2,X3)
| defined(X4,X1) ),
inference(fof_simplification,[status(thm)],[category_theory_axiom3]) ).
cnf(c_0_11,plain,
( ~ defined(X1,X2)
| product(X1,X2,compose(X1,X2)) ),
c_0_9 ).
cnf(c_0_12,hypothesis,
defined(b,c),
assume_bc_exists ).
cnf(c_0_13,plain,
( ~ defined(X4,X3)
| ~ product(X1,X2,X3)
| defined(X4,X1) ),
c_0_10 ).
cnf(c_0_14,hypothesis,
product(b,c,compose(b,c)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ identity_map(X1)
| ~ defined(X1,X2)
| product(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[identity1]) ).
cnf(c_0_16,hypothesis,
( ~ defined(X1,compose(b,c))
| defined(X1,b) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
defined(codomain(X1),X1),
mapping_from_codomain_of_x_to_x ).
cnf(c_0_18,plain,
( ~ identity_map(X1)
| ~ defined(X1,X2)
| product(X1,X2,X2) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
defined(codomain(compose(b,c)),b),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
identity_map(codomain(X1)),
codomain_is_an_identity_map ).
cnf(c_0_21,plain,
( ~ identity_map(X2)
| ~ defined(X2,X3)
| ~ defined(X1,X2)
| defined(X1,X3) ),
inference(fof_simplification,[status(thm)],[category_theory_axiom6]) ).
cnf(c_0_22,hypothesis,
product(codomain(compose(b,c)),b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
( ~ identity_map(X2)
| ~ defined(X2,X3)
| ~ defined(X1,X2)
| defined(X1,X3) ),
c_0_21 ).
cnf(c_0_24,hypothesis,
( ~ defined(X1,b)
| defined(X1,codomain(compose(b,c))) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_25,hypothesis,
defined(a,b),
assume_ab_exists ).
cnf(c_0_26,negated_conjecture,
~ defined(a,compose(b,c)),
inference(fof_simplification,[status(thm)],[prove_a_bc_exists]) ).
cnf(c_0_27,plain,
( ~ defined(X1,codomain(X2))
| defined(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_17]),c_0_20])]) ).
cnf(c_0_28,hypothesis,
defined(a,codomain(compose(b,c))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
~ defined(a,compose(b,c)),
c_0_26 ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT018-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n007.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 13:54:05 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/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.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1256943 completed with status 0
% 0.14/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FHUSM-FFSF21-SFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 136s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.45 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 1256951 completed with status 0
% 0.14/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FHUSM-FFSF21-SFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 136s (1) cores
% 0.14/0.45 % Preprocessing time : 0.001 s
% 0.14/0.45 % Presaturation interreduction done
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Unsatisfiable
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 21
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 21
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 21
% 0.14/0.45 % Processed clauses : 148
% 0.14/0.45 % ...of these trivial : 5
% 0.14/0.45 % ...subsumed : 2
% 0.14/0.45 % ...remaining for further processing : 141
% 0.14/0.45 % Other redundant clauses eliminated : 0
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 0
% 0.14/0.45 % Backward-rewritten : 4
% 0.14/0.45 % Generated clauses : 436
% 0.14/0.45 % ...of the previous two non-redundant : 361
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 0
% 0.14/0.45 % Paramodulations : 436
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 0
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 150
% 0.14/0.45 % ...of those cached : 92
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 116
% 0.14/0.45 % Positive orientable unit clauses : 45
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 1
% 0.14/0.45 % Non-unit-clauses : 70
% 0.14/0.45 % Current number of unprocessed clauses: 247
% 0.14/0.45 % ...number of literals in the above : 386
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 25
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 354
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 309
% 0.14/0.45 % Non-unit clause-clause subsumptions : 2
% 0.14/0.45 % Unit Clause-clause subsumption calls : 4
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 15
% 0.14/0.45 % BW rewrite match successes : 3
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 5811
% 0.14/0.45 % Search garbage collected termcells : 56
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.014 s
% 0.14/0.45 % System time : 0.003 s
% 0.14/0.45 % Total time : 0.016 s
% 0.14/0.45 % Maximum resident set size: 3648 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.061 s
% 0.14/0.45 % System time : 0.018 s
% 0.14/0.45 % Total time : 0.079 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------