%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT013-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:01 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.42s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 34 ( 8 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composition_is_well_defined,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',composition_is_well_defined) ).
cnf(identity1,axiom,
( ~ identity_map(X1)
| ~ defined(X1,X2)
| product(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',identity1) ).
cnf(product_on_domain,axiom,
product(X1,domain(X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',product_on_domain) ).
cnf(mapping_from_x_to_its_domain,axiom,
defined(X1,domain(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',mapping_from_x_to_its_domain) ).
cnf(prove_domain_of_codomain_is_codomain,negated_conjecture,
domain(codomain(a)) != codomain(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_codomain_is_codomain) ).
cnf(codomain_is_an_identity_map,axiom,
identity_map(codomain(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',codomain_is_an_identity_map) ).
cnf(c_0_6,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[composition_is_well_defined]) ).
cnf(c_0_7,plain,
( ~ identity_map(X1)
| ~ defined(X1,X2)
| product(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[identity1]) ).
cnf(c_0_8,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
c_0_6 ).
cnf(c_0_9,axiom,
product(X1,domain(X1),X1),
product_on_domain ).
cnf(c_0_10,plain,
( ~ identity_map(X1)
| ~ defined(X1,X2)
| product(X1,X2,X2) ),
c_0_7 ).
cnf(c_0_11,axiom,
defined(X1,domain(X1)),
mapping_from_x_to_its_domain ).
cnf(c_0_12,negated_conjecture,
domain(codomain(a)) != codomain(a),
inference(fof_simplification,[status(thm)],[prove_domain_of_codomain_is_codomain]) ).
cnf(c_0_13,plain,
( ~ product(X2,domain(X2),X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( ~ identity_map(X1)
| product(X1,domain(X1),domain(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
domain(codomain(a)) != codomain(a),
c_0_12 ).
cnf(c_0_16,plain,
( ~ identity_map(X1)
| domain(X1) = X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
identity_map(codomain(X1)),
codomain_is_an_identity_map ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT013-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n014.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:56:04 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.42 % Version: 3.5.1
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42 % Starting sh5l with 300s (1) cores
% 0.11/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 38576 completed with status 0
% 0.11/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.42 % No SInE strategy applied
% 0.11/0.42 % Search class: FHUSM-FFSF21-SFFFFFNN
% 0.11/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 136s (1) cores
% 0.11/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 38582 completed with status 0
% 0.11/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.42 % No SInE strategy applied
% 0.11/0.42 % Search class: FHUSM-FFSF21-SFFFFFNN
% 0.11/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.42 % Preprocessing time : 0.001 s
% 0.11/0.42 % Presaturation interreduction done
% 0.11/0.42
% 0.11/0.42 % Proof found!
% 0.11/0.42 % SZS status Unsatisfiable
% 0.11/0.42 % SZS output start CNFRefutation
% See solution above
% 0.11/0.42 % Parsed axioms : 19
% 0.11/0.42 % Removed by relevancy pruning/SinE : 0
% 0.11/0.42 % Initial clauses : 19
% 0.11/0.42 % Removed in clause preprocessing : 0
% 0.11/0.42 % Initial clauses in saturation : 19
% 0.11/0.42 % Processed clauses : 51
% 0.11/0.42 % ...of these trivial : 0
% 0.11/0.42 % ...subsumed : 0
% 0.11/0.42 % ...remaining for further processing : 51
% 0.11/0.42 % Other redundant clauses eliminated : 0
% 0.11/0.42 % Clauses deleted for lack of memory : 0
% 0.11/0.42 % Backward-subsumed : 0
% 0.11/0.42 % Backward-rewritten : 0
% 0.11/0.42 % Generated clauses : 76
% 0.11/0.42 % ...of the previous two non-redundant : 56
% 0.11/0.42 % ...aggressively subsumed : 0
% 0.11/0.42 % Contextual simplify-reflections : 0
% 0.11/0.42 % Paramodulations : 76
% 0.11/0.42 % Factorizations : 0
% 0.11/0.42 % NegExts : 0
% 0.11/0.42 % Equation resolutions : 0
% 0.11/0.42 % Disequality decompositions : 0
% 0.11/0.42 % Total rewrite steps : 26
% 0.11/0.42 % ...of those cached : 9
% 0.11/0.42 % Propositional unsat checks : 0
% 0.11/0.42 % Propositional check models : 0
% 0.11/0.42 % Propositional check unsatisfiable : 0
% 0.11/0.42 % Propositional clauses : 0
% 0.11/0.42 % Propositional clauses after purity: 0
% 0.11/0.42 % Propositional unsat core size : 0
% 0.11/0.42 % Propositional preprocessing time : 0.000
% 0.11/0.42 % Propositional encoding time : 0.000
% 0.11/0.42 % Propositional solver time : 0.000
% 0.11/0.42 % Success case prop preproc time : 0.000
% 0.11/0.42 % Success case prop encoding time : 0.000
% 0.11/0.42 % Success case prop solver time : 0.000
% 0.11/0.42 % Current number of processed clauses : 32
% 0.11/0.42 % Positive orientable unit clauses : 12
% 0.11/0.42 % Positive unorientable unit clauses: 0
% 0.11/0.42 % Negative unit clauses : 1
% 0.11/0.42 % Non-unit-clauses : 19
% 0.11/0.42 % Current number of unprocessed clauses: 43
% 0.11/0.42 % ...number of literals in the above : 116
% 0.11/0.42 % Current number of archived formulas : 0
% 0.11/0.42 % Current number of archived clauses : 19
% 0.11/0.42 % Clause-clause subsumption calls (NU) : 89
% 0.11/0.42 % Rec. Clause-clause subsumption calls : 81
% 0.11/0.42 % Non-unit clause-clause subsumptions : 0
% 0.11/0.42 % Unit Clause-clause subsumption calls : 0
% 0.11/0.42 % Rewrite failures with RHS unbound : 0
% 0.11/0.42 % BW rewrite match attempts : 6
% 0.11/0.42 % BW rewrite match successes : 0
% 0.11/0.42 % Condensation attempts : 0
% 0.11/0.42 % Condensation successes : 0
% 0.11/0.42 % Termbank termtop insertions : 1504
% 0.11/0.42 % Search garbage collected termcells : 56
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.004 s
% 0.11/0.42 % System time : 0.002 s
% 0.11/0.42 % Total time : 0.006 s
% 0.11/0.42 % Maximum resident set size: 3648 pages
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.015 s
% 0.11/0.42 % System time : 0.008 s
% 0.11/0.42 % Total time : 0.023 s
% 0.11/0.42 % Maximum resident set size: 4864 pages
% 0.11/0.42 % E exiting
%------------------------------------------------------------------------------