%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP710-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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 07:24:33 AM UTC 2026
% Result : Unsatisfiable 36.59s 5.06s
% Output : CNFRefutation 36.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 6 RR)
% Number of literals : 41 ( 40 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
mult(X0,unit) = X0 ).
cnf(f02,axiom,
mult(unit,X0) = X0 ).
cnf(f03,axiom,
mult(X0,mult(X1,mult(X1,X2))) = mult(mult(mult(X0,X1),X1),X2) ).
cnf(f04,axiom,
mult(X0,i(X0)) = unit ).
cnf(f05,axiom,
mult(i(X0),X0) = unit ).
cnf(goal,negated_conjecture,
mult(x0,X0) != x1 ).
cnf(c0,plain,
mult(X0,unit) = X0,
inference(clausification,[status(esa)],[f01]) ).
cnf(c1,plain,
mult(unit,X0) = X0,
inference(clausification,[status(esa)],[f02]) ).
cnf(c2,plain,
mult(X0,mult(X1,mult(X1,X2))) = mult(mult(mult(X0,X1),X1),X2),
inference(clausification,[status(esa)],[f03]) ).
cnf(c3,plain,
mult(X0,i(X0)) = unit,
inference(clausification,[status(esa)],[f04]) ).
cnf(c4,plain,
mult(i(X0),X0) = unit,
inference(clausification,[status(esa)],[f05]) ).
cnf(c5,plain,
mult(x0,X0) != x1,
inference(clausification,[status(esa)],[goal]) ).
cnf(d0,plain,
mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(mult(unit,i(X0)),X1),
inference(superposition,[status(thm)],[c3,c2]) ).
cnf(d1,plain,
mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(i(X0),X1),
inference(demodulation,[status(thm)],[d0,c1]) ).
cnf(d2,plain,
mult(i(x0),X0) != x1,
inference(superposition,[status(thm)],[d1,c5]) ).
cnf(d3,plain,
mult(unit,mult(X0,mult(X0,X1))) = mult(mult(X0,X0),X1),
inference(superposition,[status(thm)],[c1,c2]) ).
cnf(d4,plain,
mult(X0,mult(X0,X1)) = mult(mult(X0,X0),X1),
inference(demodulation,[status(thm)],[d3,c1]) ).
cnf(d5,plain,
mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
inference(superposition,[status(thm)],[c2,c0]) ).
cnf(d6,plain,
mult(X1,mult(X0,X0)) = mult(mult(X1,X0),X0),
inference(demodulation,[status(thm)],[d5,c0]) ).
cnf(d7,plain,
mult(X0,mult(X1,mult(X1,X2))) = mult(mult(X0,mult(X1,X1)),X2),
inference(demodulation,[status(thm)],[c2,d6]) ).
cnf(d8,plain,
mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(unit,X1),
inference(superposition,[status(thm)],[c4,d7]) ).
cnf(d9,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X0))) = X0,
inference(demodulation,[status(thm)],[d8,c1]) ).
cnf(d10,plain,
mult(X0,mult(X1,mult(X1,i(mult(mult(X0,X1),X1))))) = unit,
inference(superposition,[status(thm)],[c2,c3]) ).
cnf(d11,plain,
mult(X0,mult(X1,mult(X1,i(mult(X0,mult(X1,X1)))))) = unit,
inference(demodulation,[status(thm)],[d10,d6]) ).
cnf(d12,plain,
mult(i(mult(X0,X0)),unit) = mult(X0,i(mult(X0,mult(X0,X0)))),
inference(superposition,[status(thm)],[d11,d9]) ).
cnf(d13,plain,
i(mult(X0,X0)) = mult(X0,i(mult(X0,mult(X0,X0)))),
inference(demodulation,[status(thm)],[d12,c0]) ).
cnf(d14,plain,
mult(i(X0),mult(X0,mult(X0,X1))) = mult(mult(unit,X0),X1),
inference(superposition,[status(thm)],[c4,c2]) ).
cnf(d15,plain,
mult(i(X0),mult(X0,mult(X0,X1))) = mult(X0,X1),
inference(demodulation,[status(thm)],[d14,c1]) ).
cnf(d16,plain,
mult(i(X0),unit) = mult(X0,mult(X0,i(mult(X0,mult(X0,X0))))),
inference(superposition,[status(thm)],[d11,d15]) ).
cnf(d17,plain,
i(X0) = mult(X0,mult(X0,i(mult(X0,mult(X0,X0))))),
inference(demodulation,[status(thm)],[d16,c0]) ).
cnf(d18,plain,
mult(i(X0),i(X0)) = mult(X0,i(mult(X0,mult(X0,X0)))),
inference(superposition,[status(thm)],[d17,d15]) ).
cnf(d19,plain,
mult(i(X0),i(X0)) = i(mult(X0,X0)),
inference(demodulation,[status(thm)],[d18,d13]) ).
cnf(d20,plain,
mult(i(X0),mult(i(X0),X1)) = mult(i(mult(X0,X0)),X1),
inference(superposition,[status(thm)],[d19,d4]) ).
cnf(d21,plain,
mult(i(mult(x0,x0)),X0) != x1,
inference(superposition,[status(thm)],[d20,d2]) ).
cnf(d22,plain,
mult(X0,mult(unit,mult(unit,X1))) = mult(mult(X0,unit),X1),
inference(superposition,[status(thm)],[c0,c2]) ).
cnf(d23,plain,
mult(X1,mult(unit,X0)) = mult(mult(X1,unit),X0),
inference(demodulation,[status(thm)],[d22,c1]) ).
cnf(d24,plain,
mult(X1,X0) = mult(mult(X1,unit),X0),
inference(demodulation,[status(thm)],[d23,c1]) ).
cnf(d25,plain,
mult(X0,X1) = mult(X0,X1),
inference(demodulation,[status(thm)],[d24,c0]) ).
cnf(d26,plain,
X1 = mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))),
inference(superposition,[status(thm)],[d9,d25]) ).
cnf(d27,plain,
X0 != x1,
inference(superposition,[status(thm)],[d26,d21]) ).
cnf(d28,plain,
$false,
inference(equality_resolution,[status(thm)],[d27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP710-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n003.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 15:40:53 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 36.59/5.06 % SZS status Unsatisfiable for theBenchmark.p
% 36.59/5.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------