%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT393-1 : TPTP v9.2.1. Released v5.4.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 : n028.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:38:27 PM UTC 2026
% Result : Unsatisfiable 223.58s 176.89s
% Output : CNFRefutation 223.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 12 unt; 0 nHn; 7 RR)
% Number of literals : 21 ( 20 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos,axiom,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
cnf(goals,negated_conjecture,
f(x0,f(f(x1,x2),f(x1,x2))) != f(x1,f(f(x0,x2),f(x0,x2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(i_0_2,axiom,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
sos,
[final] ).
cnf(i_0_3,negated_conjecture,
f(x0,f(f(x1,x2),f(x1,x2))) != f(x1,f(f(x0,x2),f(x0,x2))),
goals,
[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,X3) = f(X2,X3) ) ).
cnf(i_0_8,axiom,
( X1 != X2
| f(X3,X1) = f(X3,X2) ) ).
cnf(i_0_9,plain,
X1 = f(f(f(f(X2,X1),f(X1,X3)),X4),f(X1,f(f(X1,f(f(X2,X2),X2)),X3))),
inference(scs_inference,[],[i_0_2,i_0_5]) ).
cnf(i_0_12,plain,
f(X1,f(f(X2,X3),f(X2,X3))) != f(X2,f(f(X1,X3),f(X1,X3))),
inference(scs_inference,[],[i_0_3,i_0_5]) ).
cnf(i_0_13,plain,
f(f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))),X5) = f(X2,X5),
inference(scs_inference,[],[i_0_2,i_0_7]) ).
cnf(i_0_14,plain,
f(X1,f(f(f(f(X2,X3),f(X3,X4)),X5),f(X3,f(f(X3,f(f(X2,X2),X2)),X4)))) = f(X1,X3),
inference(scs_inference,[],[i_0_2,i_0_7,i_0_8]) ).
cnf(i_0_79,plain,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
inference(rename_variables,[],[i_0_2]) ).
cnf(c_0_14,plain,
f(X1,f(f(X2,X3),f(X2,X3))) != f(X2,f(f(X1,X3),f(X1,X3))),
i_0_12 ).
cnf(c_0_15,plain,
$false,
inference(er,[status(thm)],[c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT393-1 : TPTP v9.2.1. Released v5.4.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 : n028.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 : Mon May 4 21:50:30 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 223.58/176.89 % Version : CSE_E---1.7
% 223.58/176.89 % Problem : theBenchmark.p
% 223.58/176.89 % SZS status Unsatisfiable for theBenchmark.p
% 223.58/176.89 % SZS output start CNFRefutation
% See solution above
% 223.80/177.04 % Total time : 176.551s
%------------------------------------------------------------------------------