%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LDA003-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 : n029.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:46:52 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 10 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a1,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1) ).
cnf(clause_5,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,axiom,
n2 = f(n1,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(a2,axiom,
left(X1,f(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).
cnf(prove_equation,negated_conjecture,
~ left(n3,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_0_6,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
a1 ).
cnf(c_0_7,axiom,
n3 = f(n2,n1),
clause_5 ).
cnf(c_0_8,plain,
f(f(n2,X1),n3) = f(n2,f(X1,n1)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
n2 = f(n1,n1),
clause_4 ).
cnf(c_0_10,axiom,
u = f(n2,n2),
clause_6 ).
cnf(c_0_11,axiom,
left(X1,f(X1,X2)),
a2 ).
cnf(c_0_12,plain,
f(n3,n3) = u,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_9]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ left(n3,u),
prove_equation ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LDA003-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.15/0.32 % Computer : n029.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 23:19:59 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.71 % Total time : 1.372s
%------------------------------------------------------------------------------