%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP186-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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:28:18 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 36 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_identity,axiom,
! [VAR_0] : multiply(identity,VAR_0) = VAR_0,
file('theBenchmark.p',left_identity) ).
cnf(c_1,plain,
multiply(identity,A) = A,
inference(clausify,[status(thm)],[left_identity]) ).
fof(left_inverse,axiom,
! [VAR_0] : multiply(inverse(VAR_0),VAR_0) = identity,
file('theBenchmark.p',left_inverse) ).
cnf(c_2,plain,
multiply(inverse(A),A) = identity,
inference(clausify,[status(thm)],[left_inverse]) ).
fof(associativity,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(multiply(VAR_0,VAR_1),VAR_2) = multiply(VAR_0,multiply(VAR_1,VAR_2)),
file('theBenchmark.p',associativity) ).
cnf(c_3,plain,
multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
inference(clausify,[status(thm)],[associativity]) ).
fof(symmetry_of_lub,axiom,
! [VAR_0,VAR_1] : least_upper_bound(VAR_0,VAR_1) = least_upper_bound(VAR_1,VAR_0),
file('theBenchmark.p',symmetry_of_lub) ).
cnf(c_5,plain,
least_upper_bound(A,B) = least_upper_bound(B,A),
inference(clausify,[status(thm)],[symmetry_of_lub]) ).
fof(monotony_lub1,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,least_upper_bound(VAR_1,VAR_2)) = least_upper_bound(multiply(VAR_0,VAR_1),multiply(VAR_0,VAR_2)),
file('theBenchmark.p',monotony_lub1) ).
cnf(c_14,plain,
multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)),
inference(clausify,[status(thm)],[monotony_lub1]) ).
cnf(c_15,plain,
least_upper_bound(multiply(A,B),multiply(A,C)) = multiply(A,least_upper_bound(B,C)),
inference(copy,[status(thm)],[c_14]) ).
fof(prove_p23x,axiom,
least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
file('theBenchmark.p',prove_p23x) ).
cnf(c_22,plain,
least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
inference(clausify,[status(thm)],[prove_p23x]) ).
cnf(c_118,plain,
least_upper_bound(identity,multiply(a,b)) != multiply(a,least_upper_bound(inverse(a),b)),
inference(paramod,[status(thm)],[c_5,c_22]) ).
cnf(c_119,plain,
least_upper_bound(identity,multiply(a,b)) != multiply(a,least_upper_bound(b,inverse(a))),
inference(paramod,[status(thm)],[c_5,c_118]) ).
cnf(c_23,plain,
multiply(a,least_upper_bound(b,inverse(a))) != least_upper_bound(identity,multiply(a,b)),
inference(copy,[status(thm)],[c_119]) ).
cnf(c_120,plain,
multiply(identity,A) = multiply(inverse(B),multiply(B,A)),
inference(paramod,[status(thm)],[c_2,c_3]) ).
cnf(c_121,plain,
A = multiply(inverse(B),multiply(B,A)),
inference(paramod,[status(thm)],[c_1,c_120]) ).
cnf(c_24,plain,
multiply(inverse(A),multiply(A,B)) = B,
inference(copy,[status(thm)],[c_121]) ).
cnf(c_74,plain,
multiply(inverse(inverse(A)),B) = multiply(A,B),
inference(paramod,[status(thm)],[c_24,c_24]) ).
cnf(c_107,plain,
multiply(A,inverse(A)) = identity,
inference(paramod,[status(thm)],[c_74,c_2]) ).
cnf(c_122,plain,
least_upper_bound(multiply(A,B),identity) = multiply(A,least_upper_bound(B,inverse(A))),
inference(paramod,[status(thm)],[c_107,c_15]) ).
cnf(c_116,plain,
least_upper_bound(identity,multiply(A,B)) = multiply(A,least_upper_bound(B,inverse(A))),
inference(paramod,[status(thm)],[c_5,c_122]) ).
cnf(c_123,plain,
least_upper_bound(identity,multiply(a,b)) != multiply(a,least_upper_bound(b,inverse(a))),
inference(copy,[status(thm)],[c_23]) ).
cnf(c_117,plain,
$false,
inference(resolve,[status(thm)],[c_116,c_123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP186-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n005.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Fri Sep 25 14:36:47 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 3706367 was started by sandbox on n005,
% 0.17/0.44 % Fri Sep 25 14:36:47 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.17/0.47
% 0.17/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47
% 0.17/0.47 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.17/0.47 % Length of proof is 13.
% 0.17/0.47 % Level of proof is 5.
% 0.17/0.47 % Maximum clause weight is 13.000.
% 0.17/0.47 % Given clauses 30.
% 0.17/0.47
% 0.17/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------