%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : LDA007-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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 : Tue Sep 29 12:01:22 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 24 RR)
% Number of literals : 33 ( 32 equ; 1 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 : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
f(t,tsk) != f(tt_ts,tk),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
cnf(c2,axiom,
ts = f(t,s),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c3,plain,
f(t,ts) = f(t,f(t,s)),
inference(congruence,[status(thm)],[c2]) ).
cnf(c4,axiom,
tt = f(t,t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c5,plain,
f(tt,f(t,X2)) = f(f(t,t),f(t,X2)),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,axiom,
f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
cnf(c7,plain,
f(t,f(t,X2)) = f(f(t,t),f(t,X2)),
inference(substitution,[status(thm)],[c6]) ).
cnf(c8,plain,
f(f(t,t),f(t,X2)) = f(t,f(t,X2)),
inference(symmetry,[status(thm)],[c7]) ).
cnf(c9,plain,
f(tt,f(t,X2)) = f(t,f(t,X2)),
inference(transitivity,[status(thm)],[c5,c8]) ).
cnf(c10,plain,
f(tt,f(t,s)) = f(t,f(t,s)),
inference(substitution,[status(thm)],[c9]) ).
cnf(c11,plain,
f(t,f(t,s)) = f(tt,f(t,s)),
inference(symmetry,[status(thm)],[c10]) ).
cnf(c12,plain,
f(t,s) = ts,
inference(symmetry,[status(thm)],[c2]) ).
cnf(c13,plain,
f(tt,f(t,s)) = f(tt,ts),
inference(congruence,[status(thm)],[c12]) ).
cnf(c14,axiom,
tt_ts = f(tt,ts),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c15,plain,
f(tt,ts) = tt_ts,
inference(symmetry,[status(thm)],[c14]) ).
cnf(c16,plain,
f(tt,f(t,s)) = tt_ts,
inference(transitivity,[status(thm)],[c13,c15]) ).
cnf(c17,plain,
f(t,f(t,s)) = tt_ts,
inference(transitivity,[status(thm)],[c11,c16]) ).
cnf(c18,plain,
f(t,ts) = tt_ts,
inference(transitivity,[status(thm)],[c3,c17]) ).
cnf(c19,plain,
tt_ts = f(t,ts),
inference(symmetry,[status(thm)],[c18]) ).
cnf(c20,plain,
f(tt_ts,tk) = f(f(t,ts),tk),
inference(congruence,[status(thm)],[c19]) ).
cnf(c21,axiom,
tk = f(t,k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c22,plain,
f(f(t,X2),tk) = f(f(t,X2),f(t,k)),
inference(congruence,[status(thm)],[c21]) ).
cnf(c23,plain,
f(t,f(X2,k)) = f(f(t,X2),f(t,k)),
inference(substitution,[status(thm)],[c6]) ).
cnf(c24,plain,
f(f(t,X2),f(t,k)) = f(t,f(X2,k)),
inference(symmetry,[status(thm)],[c23]) ).
cnf(c25,plain,
f(f(t,X2),tk) = f(t,f(X2,k)),
inference(transitivity,[status(thm)],[c22,c24]) ).
cnf(c26,plain,
f(f(t,ts),tk) = f(t,f(ts,k)),
inference(substitution,[status(thm)],[c25]) ).
cnf(c27,axiom,
tsk = f(ts,k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c28,plain,
f(ts,k) = tsk,
inference(symmetry,[status(thm)],[c27]) ).
cnf(c29,plain,
f(t,f(ts,k)) = f(t,tsk),
inference(congruence,[status(thm)],[c28]) ).
cnf(c30,plain,
f(f(t,ts),tk) = f(t,tsk),
inference(transitivity,[status(thm)],[c26,c29]) ).
cnf(c31,plain,
f(tt_ts,tk) = f(t,tsk),
inference(transitivity,[status(thm)],[c20,c30]) ).
cnf(c32,plain,
f(t,tsk) = f(tt_ts,tk),
inference(symmetry,[status(thm)],[c31]) ).
cnf(c33,plain,
$false,
inference(resolution,[status(thm)],[c1,c32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LDA007-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 17:12:08 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.45 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.10/0.45
% 0.10/0.45 % SZS status Unsatisfiable
% 0.10/0.45
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.20/0.47
% 0.20/0.47 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------