%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LDA007-2 : TPTP v9.2.1. Bugfixed v2.6.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 : n031.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:53 PM UTC 2026
% Result : Unsatisfiable 1.30s 1.77s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 14 RR)
% Number of literals : 18 ( 17 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 8 ( 0 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_1,axiom,
tt = f(t,t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_7,axiom,
tk = f(t,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_3,axiom,
ts = f(t,s),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_4,axiom,
tt_ts = f(tt,ts),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_9,axiom,
tsk = f(ts,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(prove_equation,negated_conjecture,
f(t,tsk) != f(tt_ts,tk),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_0_7,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
a1 ).
cnf(c_0_8,axiom,
tt = f(t,t),
clause_1 ).
cnf(c_0_9,axiom,
tk = f(t,k),
clause_7 ).
cnf(c_0_10,plain,
f(tt,f(t,X1)) = f(t,f(t,X1)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
ts = f(t,s),
clause_3 ).
cnf(c_0_12,axiom,
tt_ts = f(tt,ts),
clause_4 ).
cnf(c_0_13,plain,
f(f(t,X1),tk) = f(t,f(X1,k)),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_14,plain,
f(t,ts) = tt_ts,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,axiom,
tsk = f(ts,k),
clause_9 ).
cnf(c_0_16,negated_conjecture,
f(t,tsk) != f(tt_ts,tk),
prove_equation ).
cnf(c_0_17,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LDA007-2 : TPTP v9.2.1. Bugfixed v2.6.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.33 % Computer : n031.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 23:24:38 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.30/1.77 % Version : CSE_E---1.7
% 1.30/1.77 % Problem : theBenchmark.p
% 1.30/1.77 % SZS status Unsatisfiable for theBenchmark.p
% 1.30/1.77 % SZS output start CNFRefutation
% See solution above
% 1.30/1.77 % Total time : 1.420s
%------------------------------------------------------------------------------