%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT012-3 : 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 : 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:01 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.59s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 9 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain_codomain_composition1,axiom,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).
cnf(domain_has_elements,axiom,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',domain_has_elements) ).
cnf(prove_codomain_of_domain_is_domain,negated_conjecture,
codomain(domain(a)) != domain(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_codomain_of_domain_is_domain) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',compose_domain) ).
cnf(assume_domain_exists,hypothesis,
there_exists(domain(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_domain_exists) ).
cnf(c_0_5,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
inference(fof_simplification,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_0_6,plain,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
inference(fof_simplification,[status(thm)],[domain_has_elements]) ).
cnf(c_0_7,negated_conjecture,
codomain(domain(a)) != domain(a),
inference(fof_simplification,[status(thm)],[prove_codomain_of_domain_is_domain]) ).
cnf(c_0_8,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
c_0_5 ).
cnf(c_0_9,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_10,plain,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
c_0_6 ).
cnf(c_0_11,hypothesis,
there_exists(domain(a)),
assume_domain_exists ).
cnf(c_0_12,negated_conjecture,
codomain(domain(a)) != domain(a),
c_0_7 ).
cnf(c_0_13,plain,
( ~ there_exists(X1)
| codomain(domain(X1)) = domain(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,hypothesis,
there_exists(a),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT012-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.53 % Computer : n002.cluster.edu
% 0.12/0.53 % Model : x86_64 x86_64
% 0.12/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.53 % Memory : 8046.5625MB
% 0.12/0.53 % OS : Linux 6.8.0-71-generic
% 0.12/0.53 % CPULimit : 300
% 0.12/0.53 % WCLimit : 300
% 0.12/0.53 % DateTime : Mon Sep 21 13:58:48 UTC 2026
% 0.12/0.53 % CPUTime :
% 0.12/0.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.57 Running first-order theorem proving
% 0.14/0.57 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.14/0.59 % Version: 3.5.1
% 0.14/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.59 % Starting sh5l with 300s (1) cores
% 0.14/0.59 % new_bool_3 with pid 3454436 completed with status 0
% 0.14/0.59 % Result found by new_bool_3
% 0.14/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.59 % Search class: FHUSS-FFSF21-SFFFFFNN
% 0.14/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.59 % SubtermCWHack with pid 3454441 completed with status 0
% 0.14/0.59 % Result found by SubtermCWHack
% 0.14/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.59 % Search class: FHUSS-FFSF21-SFFFFFNN
% 0.14/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.59 % Preprocessing time : 0.001 s
% 0.14/0.59
% 0.14/0.59 % Proof found!
% 0.14/0.59 % SZS status Unsatisfiable
% 0.14/0.59 % SZS output start CNFRefutation
% See solution above
% 0.14/0.59 % Parsed axioms : 19
% 0.14/0.59 % Removed by relevancy pruning/SinE : 8
% 0.14/0.59 % Initial clauses : 11
% 0.14/0.59 % Removed in clause preprocessing : 0
% 0.14/0.59 % Initial clauses in saturation : 11
% 0.14/0.59 % Processed clauses : 19
% 0.14/0.59 % ...of these trivial : 0
% 0.14/0.59 % ...subsumed : 3
% 0.14/0.59 % ...remaining for further processing : 16
% 0.14/0.59 % Other redundant clauses eliminated : 0
% 0.14/0.59 % Clauses deleted for lack of memory : 0
% 0.14/0.59 % Backward-subsumed : 0
% 0.14/0.59 % Backward-rewritten : 0
% 0.14/0.59 % Generated clauses : 23
% 0.14/0.59 % ...of the previous two non-redundant : 15
% 0.14/0.59 % ...aggressively subsumed : 0
% 0.14/0.59 % Contextual simplify-reflections : 0
% 0.14/0.59 % Paramodulations : 23
% 0.14/0.59 % Factorizations : 0
% 0.14/0.59 % NegExts : 0
% 0.14/0.59 % Equation resolutions : 0
% 0.14/0.59 % Disequality decompositions : 0
% 0.14/0.59 % Total rewrite steps : 1
% 0.14/0.59 % ...of those cached : 0
% 0.14/0.59 % Propositional unsat checks : 0
% 0.14/0.59 % Propositional check models : 0
% 0.14/0.59 % Propositional check unsatisfiable : 0
% 0.14/0.59 % Propositional clauses : 0
% 0.14/0.59 % Propositional clauses after purity: 0
% 0.14/0.59 % Propositional unsat core size : 0
% 0.14/0.59 % Propositional preprocessing time : 0.000
% 0.14/0.59 % Propositional encoding time : 0.000
% 0.14/0.59 % Propositional solver time : 0.000
% 0.14/0.59 % Success case prop preproc time : 0.000
% 0.14/0.59 % Success case prop encoding time : 0.000
% 0.14/0.59 % Success case prop solver time : 0.000
% 0.14/0.59 % Current number of processed clauses : 16
% 0.14/0.59 % Positive orientable unit clauses : 4
% 0.14/0.59 % Positive unorientable unit clauses: 0
% 0.14/0.59 % Negative unit clauses : 1
% 0.14/0.59 % Non-unit-clauses : 11
% 0.14/0.59 % Current number of unprocessed clauses: 3
% 0.14/0.59 % ...number of literals in the above : 6
% 0.14/0.59 % Current number of archived formulas : 0
% 0.14/0.59 % Current number of archived clauses : 0
% 0.14/0.59 % Clause-clause subsumption calls (NU) : 8
% 0.14/0.59 % Rec. Clause-clause subsumption calls : 8
% 0.14/0.59 % Non-unit clause-clause subsumptions : 3
% 0.14/0.59 % Unit Clause-clause subsumption calls : 0
% 0.14/0.59 % Rewrite failures with RHS unbound : 0
% 0.14/0.59 % BW rewrite match attempts : 0
% 0.14/0.59 % BW rewrite match successes : 0
% 0.14/0.59 % Condensation attempts : 0
% 0.14/0.59 % Condensation successes : 0
% 0.14/0.59 % Termbank termtop insertions : 490
% 0.14/0.59 % Search garbage collected termcells : 41
% 0.14/0.59
% 0.14/0.59 % -------------------------------------------------
% 0.14/0.59 % User time : 0.001 s
% 0.14/0.59 % System time : 0.004 s
% 0.14/0.59 % Total time : 0.005 s
% 0.14/0.59 % Maximum resident set size: 3644 pages
% 0.14/0.59
% 0.14/0.59 % -------------------------------------------------
% 0.14/0.59 % User time : 0.002 s
% 0.14/0.59 % System time : 0.006 s
% 0.14/0.59 % Total time : 0.008 s
% 0.14/0.59 % Maximum resident set size: 4864 pages
% 0.14/0.59 % E exiting
%------------------------------------------------------------------------------