%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT394-2 : TPTP v9.2.1. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n021.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 1.61s 1.82s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 3 RR)
% Number of literals : 33 ( 32 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 73 ( 21 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/sandbox2/benchmark/theBenchmark.p',sos) ).
cnf(goals,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_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 ).
cnf(c_0_3,plain,
f(X1,f(f(X1,X2),f(f(f(X1,X2),f(f(f(X3,X1),f(X3,X1)),f(X3,X1))),X4))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
f(f(X1,X2),f(f(f(X1,X2),f(X2,X3)),X2)) = f(f(X1,X2),f(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
f(f(f(f(X1,X2),f(X2,X3)),X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
f(f(X1,X1),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
f(f(X1,X2),f(X1,f(f(X1,f(f(X1,X1),X1)),X1))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_8,plain,
f(X1,f(f(X1,X2),f(X1,X2))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
f(f(X1,X2),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
f(X1,f(f(X1,X1),X2)) = f(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
f(f(X1,X1),f(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_2]) ).
cnf(c_0_13,plain,
f(f(X1,X2),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_14,plain,
f(f(f(X1,X2),f(X1,X2)),X1) = f(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_15,plain,
f(f(X1,X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,plain,
f(f(X1,X2),f(X2,f(f(X1,X1),X1))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_17,plain,
f(f(X1,X1),f(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
f(X1,f(f(X1,X2),f(X1,f(X1,X1)))) = f(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_9]) ).
cnf(c_0_19,plain,
f(X1,f(X2,f(X1,X1))) = f(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_20,plain,
f(f(X1,X2),f(X1,f(f(X3,X3),X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_18]),c_0_19]),c_0_15]) ).
cnf(c_0_21,plain,
f(X1,X1) = f(X1,f(f(X2,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_20]) ).
cnf(c_0_22,plain,
f(f(f(X1,X1),X2),X1) = f(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_23,plain,
f(f(X1,f(X2,X2)),X2) = f(X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_24,plain,
f(f(X1,X1),f(f(X2,X2),X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_21]),c_0_22]),c_0_9]) ).
cnf(c_0_25,plain,
f(f(X1,f(f(X2,X2),X2)),f(X3,X1)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
f(f(X1,X2),f(X2,f(f(X3,X3),X3))) = X2,
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_27,plain,
f(f(X1,X1),f(X2,f(X2,X2))) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_28,plain,
f(f(X1,X1),X1) = f(f(X2,X2),X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
f(f(X1,X1),X1) = f(X2,f(X2,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
goals ).
cnf(c_0_31,plain,
f(X1,f(X1,X1)) = f(X2,f(X2,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_30,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT394-2 : TPTP v9.2.1. Released v5.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n021.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:51:10 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.61/1.82 % Version : CSE_E---1.7
% 1.61/1.82 % Problem : theBenchmark.p
% 1.61/1.82 % SZS status Unsatisfiable for theBenchmark.p
% 1.61/1.82 % SZS output start CNFRefutation
% See solution above
% 1.61/1.82 % Total time : 1.372s
%------------------------------------------------------------------------------