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