%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CAT003-3 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:11:38 PM UTC 2026
% Result : Unsatisfiable 1.66s 1.86s
% Output : CNFRefutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 18 ( 17 equ; 8 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 : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(epimorphism,hypothesis,
( X1 = X3
| compose(X1,compose(a,b)) != X2
| compose(X3,compose(a,b)) != X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',epimorphism) ).
cnf(associativity_of_compose,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',associativity_of_compose) ).
cnf(ha_equals_ga,hypothesis,
compose(h,a) = compose(g,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ha_equals_ga) ).
cnf(prove_g_equals_h,negated_conjecture,
g != h,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_g_equals_h) ).
cnf(c_0_4,hypothesis,
( X1 = X3
| compose(X1,compose(a,b)) != X2
| compose(X3,compose(a,b)) != X2 ),
epimorphism ).
cnf(c_0_5,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
associativity_of_compose ).
cnf(c_0_6,hypothesis,
compose(h,a) = compose(g,a),
ha_equals_ga ).
cnf(c_0_7,hypothesis,
( X1 = X2
| compose(X1,compose(a,b)) != compose(X2,compose(a,b)) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
compose(g,compose(a,X1)) = compose(h,compose(a,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_5]) ).
cnf(c_0_9,hypothesis,
( g = X1
| compose(h,compose(a,b)) != compose(X1,compose(a,b)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
g != h,
prove_g_equals_h ).
cnf(c_0_11,hypothesis,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT003-3 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.34 % Computer : n022.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue May 5 10:47:06 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.35 % start to proof: theBenchmark
% 1.66/1.86 % Version : CSE_E---1.7
% 1.66/1.86 % Problem : theBenchmark.p
% 1.66/1.86 % SZS status Unsatisfiable for theBenchmark.p
% 1.66/1.86 % SZS output start CNFRefutation
% See solution above
% 1.66/1.86 % Total time : 1.374s
%------------------------------------------------------------------------------