%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN080-1 : 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 : n006.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 05:36:05 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of clauses : 16 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 26 ( 25 equ; 12 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 : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 26 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
f(f(a)) != f(g(b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(clause_1,axiom,
f(X1) = g(X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(i_0_2,negated_conjecture,
f(f(a)) != f(g(b)),
prove_this,
[final] ).
cnf(i_0_3,axiom,
f(X1) = g(X2),
clause_1,
[final] ).
cnf(i_0_4,axiom,
X1 = X1 ).
cnf(i_0_5,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_6,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_7,axiom,
( X1 != X2
| f(X1) = f(X2) ) ).
cnf(i_0_8,axiom,
( X1 != X2
| g(X1) = g(X2) ) ).
cnf(i_0_4_001,axiom,
X1 = X1 ).
cnf(i_0_5_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_6_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_7_004,axiom,
( X1 != X2
| f(X1) = f(X2) ) ).
cnf(i_0_8_005,axiom,
( X1 != X2
| g(X1) = g(X2) ) ).
cnf(i_0_9,plain,
g(X1) = f(X2),
inference(scs_inference,[],[i_0_3,i_0_5]) ).
cnf(i_0_10,plain,
$false,
inference(scs_inference,[],[i_0_2,i_0_3,i_0_5,i_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN080-1 : 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.14/0.33 % Computer : n006.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 08:12:16 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.25/1.62 % Version : CSE_E---1.7
% 0.25/1.62 % Problem : theBenchmark.p
% 0.25/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.63 % Total time : 1.272s
%------------------------------------------------------------------------------