%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP157-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 : n001.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 : 4
% Syntax : Number of formulae : 14 ( 14 unt; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 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 : 13 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(ax_mono2a_1,axiom,
least_upper_bound(a,b) = b,
file('theBenchmark.p',ax_mono2a_1) ).
cnf(c_22,plain,
least_upper_bound(a,b) = b,
inference(clausify,[status(thm)],[ax_mono2a_1]) ).
cnf(c_23,plain,
least_upper_bound(b,a) = b,
inference(paramod,[status(thm)],[c_5,c_22]) ).
fof(prove_ax_mono2a,axiom,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
file('theBenchmark.p',prove_ax_mono2a) ).
cnf(c_24,plain,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
inference(clausify,[status(thm)],[prove_ax_mono2a]) ).
cnf(c_26,plain,
least_upper_bound(multiply(c,b),multiply(c,a)) != multiply(c,b),
inference(paramod,[status(thm)],[c_5,c_24]) ).
cnf(c_27,plain,
multiply(c,least_upper_bound(b,a)) != multiply(c,b),
inference(paramod,[status(thm)],[c_15,c_26]) ).
cnf(c_28,plain,
multiply(c,b) != multiply(c,b),
inference(paramod,[status(thm)],[c_23,c_27]) ).
cnf(c_25,plain,
$false,
inference(copy,[status(thm)],[c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP157-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.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 14:37:55 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 3534636 was started by sandbox on n001,
% 0.09/0.37 % Fri Sep 25 14:37:55 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % 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 7.
% 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
%------------------------------------------------------------------------------