%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP176-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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 10:09:33 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 6 RR)
% Number of literals : 8 ( 7 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p07) ).
cnf(c2,axiom,
multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).
cnf(c3,plain,
multiply(least_upper_bound(a,b),d) = least_upper_bound(multiply(a,d),multiply(b,d)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
multiply(c,multiply(least_upper_bound(a,b),d)) = multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,axiom,
multiply(X2,least_upper_bound(Y2,Z2)) = least_upper_bound(multiply(X2,Y2),multiply(X2,Z2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub1) ).
cnf(c6,plain,
multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
inference(substitution,[status(thm)],[c5]) ).
cnf(c7,plain,
multiply(c,multiply(least_upper_bound(a,b),d)) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
inference(transitivity,[status(thm)],[c4,c6]) ).
cnf(c8,plain,
$false,
inference(resolution,[status(thm)],[c1,c7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP176-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n016.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sun Sep 27 09:40:31 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.43 Command-line arguments: --no-flatten-goal
% 0.13/0.43
% 0.13/0.43 % SZS status Unsatisfiable
% 0.13/0.43
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44
% 0.13/0.44 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------