%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LDA001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 02:10:49 PM UTC 2026
% Result : Unsatisfiable 6.58s 1.37s
% Output : CNFRefutation 6.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 29 RR)
% Number of literals : 35 ( 34 equ; 10 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t6,axiom,
sFlat2 = f(n3,n2),
introduced(definition) ).
cnf(t27,plain,
f(n3,n2) = sFlat2,
inference(orient,[status(thm)],[t6]) ).
cnf(t3,axiom,
f(f(X1,X2),f(X1,X3)) = f(X1,f(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t8,plain,
f(f(X1,X2),f(X1,X3)) = f(X1,f(X2,X3)),
inference(orient,[status(thm)],[t3]) ).
cnf(t28,plain,
f(n3,f(n2,X1)) = f(sFlat2,f(n3,X1)),
inference(cp,[status(thm)],[t8,t27]) ).
cnf(t126,plain,
f(n3,f(n2,X1)) = f(sFlat2,f(n3,X1)),
inference(orient,[status(thm)],[t28]) ).
cnf(t1,axiom,
f(n2,n1) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t24,plain,
f(n2,n1) = n3,
inference(orient,[status(thm)],[t1]) ).
cnf(t138,plain,
f(sFlat2,f(n3,n1)) = f(n3,n3),
inference(cp,[status(thm)],[t126,t24]) ).
cnf(t25,plain,
f(n2,f(n1,X1)) = f(n3,f(n2,X1)),
inference(cp,[status(thm)],[t8,t24]) ).
cnf(t101,plain,
f(n2,f(n1,X1)) = f(n3,f(n2,X1)),
inference(orient,[status(thm)],[t25]) ).
cnf(t0,axiom,
f(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t31,plain,
f(n1,n1) = n2,
inference(orient,[status(thm)],[t0]) ).
cnf(t102,plain,
f(n3,f(n2,n1)) = f(n2,n2),
inference(cp,[status(thm)],[t101,t31]) ).
cnf(t162,plain,
f(n3,n3) = f(n2,n2),
inference(step,[status(thm)],[t102,t24]) ).
cnf(t2,axiom,
f(n2,n2) = u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t21,plain,
f(n2,n2) = u,
inference(orient,[status(thm)],[t2]) ).
cnf(t163,plain,
f(n3,n3) = u,
inference(step,[status(thm)],[t162,t21]) ).
cnf(t107,plain,
f(n3,n3) = u,
inference(orient,[status(thm)],[t163]) ).
cnf(t169,plain,
f(sFlat2,f(n3,n1)) = u,
inference(step,[status(thm)],[t138,t107]) ).
cnf(t147,plain,
f(sFlat2,f(n3,n1)) = u,
inference(orient,[status(thm)],[t169]) ).
cnf(t137,plain,
f(sFlat2,f(n3,n2)) = f(n3,u),
inference(cp,[status(thm)],[t126,t21]) ).
cnf(t166,plain,
f(sFlat2,sFlat2) = f(n3,u),
inference(step,[status(thm)],[t137,t27]) ).
cnf(t141,plain,
f(n3,u) = f(sFlat2,sFlat2),
inference(orient,[status(thm)],[t166]) ).
cnf(goal_0,negated_conjecture,
f(f(u,u),u) != f(f(n3,n2),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
f(sFlat2,u) != f(f(n3,n2),u),
inference(rw,[status(thm)],[goal_0,t27]) ).
cnf(g0_1,plain,
f(sFlat2,f(sFlat2,f(n3,n1))) != f(f(n3,n2),u),
inference(rw,[status(thm)],[g0_0,t147]) ).
cnf(g0_2,plain,
f(sFlat2,f(sFlat2,f(n3,n1))) != f(f(u,f(n3,n3)),u),
inference(rw,[status(thm)],[g0_1,t107]) ).
cnf(g0_3,plain,
f(sFlat2,f(sFlat2,f(n3,n1))) != f(f(f(n3,n3),f(n3,n3)),u),
inference(rw,[status(thm)],[g0_2,t107]) ).
cnf(g0_4,plain,
f(sFlat2,f(sFlat2,f(n3,n1))) != f(f(n3,f(n3,n3)),u),
inference(rw,[status(thm)],[g0_3,t8]) ).
cnf(g0_5,plain,
f(sFlat2,f(sFlat2,f(n3,n1))) != f(f(n3,u),u),
inference(rw,[status(thm)],[g0_4,t107]) ).
cnf(g0_6,plain,
f(sFlat2,f(sFlat2,f(n3,n1))) != f(f(sFlat2,sFlat2),u),
inference(rw,[status(thm)],[g0_5,t141]) ).
cnf(g0_7,plain,
f(sFlat2,f(sFlat2,f(n3,n1))) != f(f(sFlat2,sFlat2),f(sFlat2,f(n3,n1))),
inference(rw,[status(thm)],[g0_6,t147]) ).
cnf(g0_8,plain,
f(sFlat2,f(sFlat2,f(n3,n1))) != f(sFlat2,f(sFlat2,f(n3,n1))),
inference(rw,[status(thm)],[g0_7,t8]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LDA001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.34 % Computer : n009.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Thu Sep 24 00:45:13 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.58/1.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.58/1.37 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------