%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP158-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 : n006.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:09 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.39s
% Output : CNFRefutation 0.13s
% 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_glb1,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,greatest_lower_bound(VAR_1,VAR_2)) = greatest_lower_bound(multiply(VAR_0,VAR_1),multiply(VAR_0,VAR_2)),
file('theBenchmark.p',monotony_glb1) ).
cnf(c_16,plain,
multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)),
inference(clausify,[status(thm)],[monotony_glb1]) ).
cnf(c_17,plain,
greatest_lower_bound(multiply(A,B),multiply(A,C)) = multiply(A,greatest_lower_bound(B,C)),
inference(copy,[status(thm)],[c_16]) ).
fof(ax_mono2b_1,axiom,
greatest_lower_bound(a,b) = a,
file('theBenchmark.p',ax_mono2b_1) ).
cnf(c_22,plain,
greatest_lower_bound(a,b) = a,
inference(clausify,[status(thm)],[ax_mono2b_1]) ).
fof(prove_ax_mono2b,axiom,
greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a),
file('theBenchmark.p',prove_ax_mono2b) ).
cnf(c_23,plain,
greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a),
inference(clausify,[status(thm)],[prove_ax_mono2b]) ).
cnf(c_25,plain,
multiply(c,greatest_lower_bound(a,b)) != multiply(c,a),
inference(paramod,[status(thm)],[c_17,c_23]) ).
cnf(c_26,plain,
multiply(c,a) != multiply(c,a),
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.03 % Problem : GRP158-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.37 % Computer : n006.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Fri Sep 25 14:32:10 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.13/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.37 % Process 3115498 was started by sandbox on n006,
% 0.13/0.37 % Fri Sep 25 14:32:10 2026
% 0.13/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.38
% 0.13/0.38 % From the command line: assign(max_seconds, 300).
% 0.13/0.39
% 0.13/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.39
% 0.13/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.39 % Length of proof is 5.
% 0.13/0.39 % Level of proof is 2.
% 0.13/0.39 % Maximum clause weight is 13.000.
% 0.13/0.39 % Given clauses 0.
% 0.13/0.39
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------