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