%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP155-1 : 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 : n014.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:08 AM UTC 2026
% Result : Unsatisfiable 0.05s 0.35s
% Output : CNFRefutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 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 : 9 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(monotony_glb2,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(greatest_lower_bound(VAR_0,VAR_1),VAR_2) = greatest_lower_bound(multiply(VAR_0,VAR_2),multiply(VAR_1,VAR_2)),
file('theBenchmark.p',monotony_glb2) ).
cnf(c_20,plain,
multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)),
inference(clausify,[status(thm)],[monotony_glb2]) ).
cnf(c_21,plain,
greatest_lower_bound(multiply(A,B),multiply(C,B)) = multiply(greatest_lower_bound(A,C),B),
inference(copy,[status(thm)],[c_20]) ).
fof(ax_mono1b,axiom,
greatest_lower_bound(a,b) = a,
file('theBenchmark.p',ax_mono1b) ).
cnf(c_22,plain,
greatest_lower_bound(a,b) = a,
inference(clausify,[status(thm)],[ax_mono1b]) ).
fof(prove_ax_mono1b,axiom,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
file('theBenchmark.p',prove_ax_mono1b) ).
cnf(c_23,plain,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
inference(clausify,[status(thm)],[prove_ax_mono1b]) ).
cnf(c_25,plain,
multiply(greatest_lower_bound(a,b),c) != multiply(a,c),
inference(paramod,[status(thm)],[c_21,c_23]) ).
cnf(c_26,plain,
multiply(a,c) != multiply(a,c),
inference(paramod,[status(thm)],[c_22,c_25]) ).
cnf(c_24,plain,
$false,
inference(copy,[status(thm)],[c_26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP155-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.05/0.33 % Computer : n014.cluster.edu
% 0.05/0.33 % Model : x86_64 x86_64
% 0.05/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.33 % Memory : 8046.5625MB
% 0.05/0.33 % OS : Linux 6.8.0-71-generic
% 0.05/0.33 % CPULimit : 300
% 0.05/0.33 % WCLimit : 300
% 0.05/0.33 % DateTime : Fri Sep 25 14:32:17 UTC 2026
% 0.05/0.33 % CPUTime :
% 0.05/0.33 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.05/0.33 % Process 430732 was started by sandbox on n014,
% 0.05/0.33 % Fri Sep 25 14:32:17 2026
% 0.05/0.33 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.05/0.33
% 0.05/0.33 % From the command line: assign(max_seconds, 300).
% 0.05/0.35
% 0.05/0.35 % SZS status Unsatisfiable for theBenchmark
% 0.05/0.35
% 0.05/0.35 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.05/0.35 % Length of proof is 5.
% 0.05/0.35 % Level of proof is 2.
% 0.05/0.35 % Maximum clause weight is 13.000.
% 0.05/0.35 % Given clauses 0.
% 0.05/0.35
% 0.05/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------