%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : ALG235-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.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 09:07:15 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.24s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 14 RR)
% Number of literals : 16 ( 15 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) != mult(a,mult(b,mult(d,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c2,axiom,
mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c3,plain,
mult(a,mult(c,mult(d,c))) = mult(d,mult(c,mult(a,c))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
mult(b,mult(a,mult(c,mult(d,c)))) = mult(b,mult(d,mult(c,mult(a,c)))),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,plain,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) = mult(a,mult(b,mult(d,mult(c,mult(a,c))))),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,plain,
mult(a,mult(b,mult(d,mult(c,mult(a,c))))) = mult(d,mult(b,mult(a,mult(c,mult(a,c))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c7,axiom,
mult(A2,mult(B2,mult(A2,B2))) = mult(A2,B2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c8,plain,
mult(a,mult(c,mult(a,c))) = mult(a,c),
inference(substitution,[status(thm)],[c7]) ).
cnf(c9,plain,
mult(b,mult(a,mult(c,mult(a,c)))) = mult(b,mult(a,c)),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,plain,
mult(d,mult(b,mult(a,mult(c,mult(a,c))))) = mult(d,mult(b,mult(a,c))),
inference(congruence,[status(thm)],[c9]) ).
cnf(c11,plain,
mult(a,mult(b,mult(d,c))) = mult(d,mult(b,mult(a,c))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c12,plain,
mult(d,mult(b,mult(a,c))) = mult(a,mult(b,mult(d,c))),
inference(symmetry,[status(thm)],[c11]) ).
cnf(c13,plain,
mult(d,mult(b,mult(a,mult(c,mult(a,c))))) = mult(a,mult(b,mult(d,c))),
inference(transitivity,[status(thm)],[c10,c12]) ).
cnf(c14,plain,
mult(a,mult(b,mult(d,mult(c,mult(a,c))))) = mult(a,mult(b,mult(d,c))),
inference(transitivity,[status(thm)],[c6,c13]) ).
cnf(c15,plain,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) = mult(a,mult(b,mult(d,c))),
inference(transitivity,[status(thm)],[c5,c14]) ).
cnf(c16,plain,
$false,
inference(resolution,[status(thm)],[c1,c15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG235-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.16 % Computer : n013.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Mon Sep 28 19:56:10 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.24 Command-line arguments: --no-flatten-goal
% 0.10/0.24
% 0.10/0.24 % SZS status Unsatisfiable
% 0.10/0.24
% 0.10/0.24 % SZS output start CNFRefutation
% See solution above
% 0.10/0.26
% 0.10/0.26 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------