%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CAT006-4 : 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 : n015.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:13 PM UTC 2026
% Result : Unsatisfiable 0.03s 0.42s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 13 unt; 0 nHn; 24 RR)
% Number of literals : 39 ( 15 equ; 17 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 21 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composition_implies_domain,axiom,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',composition_implies_domain) ).
cnf(domain_has_elements,axiom,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',domain_has_elements) ).
cnf(da_exists,hypothesis,
there_exists(compose(d,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',da_exists) ).
cnf(domain_codomain_composition1,axiom,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',domain_codomain_composition1) ).
cnf(xd_equals_x,hypothesis,
( ~ there_exists(compose(X1,d))
| compose(X1,d) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xd_equals_x) ).
cnf(prove_codomain_of_a_is_d,negated_conjecture,
codomain(a) != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_codomain_of_a_is_d) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',compose_codomain) ).
cnf(c_0_7,plain,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
inference(fof_simplification,[status(thm)],[composition_implies_domain]) ).
cnf(c_0_8,plain,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
inference(fof_simplification,[status(thm)],[domain_has_elements]) ).
cnf(c_0_9,plain,
( ~ there_exists(compose(X1,X2))
| there_exists(domain(X1)) ),
c_0_7 ).
cnf(c_0_10,hypothesis,
there_exists(compose(d,a)),
da_exists ).
cnf(c_0_11,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
inference(fof_simplification,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_0_12,hypothesis,
( ~ there_exists(compose(X1,d))
| compose(X1,d) = X1 ),
inference(fof_simplification,[status(thm)],[xd_equals_x]) ).
cnf(c_0_13,plain,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
c_0_8 ).
cnf(c_0_14,hypothesis,
there_exists(domain(d)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
codomain(a) != d,
inference(fof_simplification,[status(thm)],[prove_codomain_of_a_is_d]) ).
cnf(c_0_16,plain,
( ~ there_exists(compose(X1,X2))
| domain(X1) = codomain(X2) ),
c_0_11 ).
cnf(c_0_17,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_18,hypothesis,
( ~ there_exists(compose(X1,d))
| compose(X1,d) = X1 ),
c_0_12 ).
cnf(c_0_19,hypothesis,
there_exists(d),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
codomain(a) != d,
c_0_15 ).
cnf(c_0_21,hypothesis,
codomain(a) = domain(d),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_22,plain,
( ~ there_exists(X1)
| domain(codomain(X1)) = codomain(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,hypothesis,
codomain(d) = d,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_19])]) ).
cnf(c_0_24,negated_conjecture,
domain(d) != d,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CAT006-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.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:59:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.41 Running first-order theorem proving
% 0.03/0.41 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.03/0.42 % Version: 3.5.1
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.42 % Starting sh5l with 300s (1) cores
% 0.03/0.42 % new_bool_3 with pid 1635244 completed with status 0
% 0.03/0.42 % Result found by new_bool_3
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.42 % Search class: FHUSS-FFSF21-SFFFFFNN
% 0.03/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.42 % SubtermCWHack with pid 1635249 completed with status 0
% 0.03/0.42 % Result found by SubtermCWHack
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.42 % Search class: FHUSS-FFSF21-SFFFFFNN
% 0.03/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.42 % Preprocessing time : 0.001 s
% 0.03/0.42
% 0.03/0.42 % Proof found!
% 0.03/0.42 % SZS status Unsatisfiable
% 0.03/0.42 % SZS output start CNFRefutation
% See solution above
% 0.03/0.42 % Parsed axioms : 15
% 0.03/0.42 % Removed by relevancy pruning/SinE : 3
% 0.03/0.42 % Initial clauses : 12
% 0.03/0.42 % Removed in clause preprocessing : 0
% 0.03/0.42 % Initial clauses in saturation : 12
% 0.03/0.42 % Processed clauses : 23
% 0.03/0.42 % ...of these trivial : 0
% 0.03/0.42 % ...subsumed : 1
% 0.03/0.42 % ...remaining for further processing : 22
% 0.03/0.42 % Other redundant clauses eliminated : 0
% 0.03/0.42 % Clauses deleted for lack of memory : 0
% 0.03/0.42 % Backward-subsumed : 0
% 0.03/0.42 % Backward-rewritten : 2
% 0.03/0.42 % Generated clauses : 31
% 0.03/0.42 % ...of the previous two non-redundant : 18
% 0.03/0.42 % ...aggressively subsumed : 0
% 0.03/0.42 % Contextual simplify-reflections : 0
% 0.03/0.42 % Paramodulations : 31
% 0.03/0.42 % Factorizations : 0
% 0.03/0.42 % NegExts : 0
% 0.03/0.42 % Equation resolutions : 0
% 0.03/0.42 % Disequality decompositions : 0
% 0.03/0.42 % Total rewrite steps : 24
% 0.03/0.42 % ...of those cached : 18
% 0.03/0.42 % Propositional unsat checks : 0
% 0.03/0.42 % Propositional check models : 0
% 0.03/0.42 % Propositional check unsatisfiable : 0
% 0.03/0.42 % Propositional clauses : 0
% 0.03/0.42 % Propositional clauses after purity: 0
% 0.03/0.42 % Propositional unsat core size : 0
% 0.03/0.42 % Propositional preprocessing time : 0.000
% 0.03/0.42 % Propositional encoding time : 0.000
% 0.03/0.42 % Propositional solver time : 0.000
% 0.03/0.42 % Success case prop preproc time : 0.000
% 0.03/0.42 % Success case prop encoding time : 0.000
% 0.03/0.42 % Success case prop solver time : 0.000
% 0.03/0.42 % Current number of processed clauses : 20
% 0.03/0.42 % Positive orientable unit clauses : 10
% 0.03/0.42 % Positive unorientable unit clauses: 0
% 0.03/0.42 % Negative unit clauses : 1
% 0.03/0.42 % Non-unit-clauses : 9
% 0.03/0.42 % Current number of unprocessed clauses: 6
% 0.03/0.42 % ...number of literals in the above : 11
% 0.03/0.42 % Current number of archived formulas : 0
% 0.03/0.42 % Current number of archived clauses : 2
% 0.03/0.42 % Clause-clause subsumption calls (NU) : 4
% 0.03/0.42 % Rec. Clause-clause subsumption calls : 4
% 0.03/0.42 % Non-unit clause-clause subsumptions : 1
% 0.03/0.42 % Unit Clause-clause subsumption calls : 0
% 0.03/0.42 % Rewrite failures with RHS unbound : 0
% 0.03/0.42 % BW rewrite match attempts : 2
% 0.03/0.42 % BW rewrite match successes : 2
% 0.03/0.42 % Condensation attempts : 0
% 0.03/0.42 % Condensation successes : 0
% 0.03/0.42 % Termbank termtop insertions : 521
% 0.03/0.42 % Search garbage collected termcells : 29
% 0.03/0.42
% 0.03/0.42 % -------------------------------------------------
% 0.03/0.42 % User time : 0.004 s
% 0.03/0.42 % System time : 0.000 s
% 0.03/0.42 % Total time : 0.004 s
% 0.03/0.42 % Maximum resident set size: 3640 pages
% 0.03/0.42
% 0.03/0.42 % -------------------------------------------------
% 0.03/0.42 % User time : 0.007 s
% 0.03/0.42 % System time : 0.000 s
% 0.03/0.42 % Total time : 0.007 s
% 0.03/0.42 % Maximum resident set size: 4864 pages
% 0.03/0.42 % E exiting
%------------------------------------------------------------------------------