%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LDA003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.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 : Sun Sep 27 08:00:12 AM UTC 2026
% Result : Unsatisfiable 11.19s 1.82s
% Output : CNFRefutation 11.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 8 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 : 14 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a1,axiom,
f(X0,f(X1,X2)) = f(f(X0,X1),f(X0,X2)) ).
cnf(a2,axiom,
left(X0,f(X0,X1)) ).
cnf(clause_4,axiom,
n2 = f(n1,n1) ).
cnf(clause_5,axiom,
n3 = f(n2,n1) ).
cnf(clause_6,axiom,
u = f(n2,n2) ).
cnf(prove_equation,negated_conjecture,
~ left(n3,u) ).
cnf(c0,plain,
f(X0,f(X1,X2)) = f(f(X0,X1),f(X0,X2)),
inference(clausification,[status(esa)],[a1]) ).
cnf(c1,plain,
left(X0,f(X0,X1)),
inference(clausification,[status(esa)],[a2]) ).
cnf(c3,plain,
n2 = f(n1,n1),
inference(clausification,[status(esa)],[clause_4]) ).
cnf(c4,plain,
n3 = f(n2,n1),
inference(clausification,[status(esa)],[clause_5]) ).
cnf(c5,plain,
u = f(n2,n2),
inference(clausification,[status(esa)],[clause_6]) ).
cnf(c6,plain,
~ left(n3,u),
inference(clausification,[status(esa)],[prove_equation]) ).
cnf(d0,plain,
left(f(X0,X1),f(X0,f(X1,X2))),
inference(superposition,[status(thm)],[c0,c1]) ).
cnf(d1,plain,
left(n3,f(n2,f(n1,X0))),
inference(superposition,[status(thm)],[c4,d0]) ).
cnf(d2,plain,
left(n3,f(n2,n2)),
inference(superposition,[status(thm)],[c3,d1]) ).
cnf(d3,plain,
left(n3,u),
inference(demodulation,[status(thm)],[d2,c5]) ).
cnf(d4,plain,
$false,
inference(resolution,[status(thm)],[c6,d3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LDA003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n006.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 23:55:14 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.19/1.82 % SZS status Unsatisfiable for theBenchmark.p
% 11.19/1.82 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------