%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP140-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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:06 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 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 : 27 ( 2 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(symmetry_of_glb,axiom,
! [VAR_0,VAR_1] : greatest_lower_bound(VAR_0,VAR_1) = greatest_lower_bound(VAR_1,VAR_0),
file('theBenchmark.p',symmetry_of_glb) ).
cnf(c_4,plain,
greatest_lower_bound(A,B) = greatest_lower_bound(B,A),
inference(clausify,[status(thm)],[symmetry_of_glb]) ).
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(associativity_of_glb,axiom,
! [VAR_0,VAR_1,VAR_2] : greatest_lower_bound(VAR_0,greatest_lower_bound(VAR_1,VAR_2)) = greatest_lower_bound(greatest_lower_bound(VAR_0,VAR_1),VAR_2),
file('theBenchmark.p',associativity_of_glb) ).
cnf(c_6,plain,
greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C),
inference(clausify,[status(thm)],[associativity_of_glb]) ).
cnf(c_7,plain,
greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)),
inference(copy,[status(thm)],[c_6]) ).
fof(lub_absorbtion,axiom,
! [VAR_0,VAR_1] : least_upper_bound(VAR_0,greatest_lower_bound(VAR_0,VAR_1)) = VAR_0,
file('theBenchmark.p',lub_absorbtion) ).
cnf(c_12,plain,
least_upper_bound(A,greatest_lower_bound(A,B)) = A,
inference(clausify,[status(thm)],[lub_absorbtion]) ).
fof(ax_glb1c_1,axiom,
greatest_lower_bound(a,c) = c,
file('theBenchmark.p',ax_glb1c_1) ).
cnf(c_22,plain,
greatest_lower_bound(a,c) = c,
inference(clausify,[status(thm)],[ax_glb1c_1]) ).
cnf(c_23,plain,
greatest_lower_bound(c,a) = c,
inference(paramod,[status(thm)],[c_4,c_22]) ).
fof(ax_glb1c_2,axiom,
greatest_lower_bound(b,c) = c,
file('theBenchmark.p',ax_glb1c_2) ).
cnf(c_24,plain,
greatest_lower_bound(b,c) = c,
inference(clausify,[status(thm)],[ax_glb1c_2]) ).
cnf(c_25,plain,
greatest_lower_bound(c,b) = c,
inference(paramod,[status(thm)],[c_4,c_24]) ).
fof(prove_ax_glb1c,axiom,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
file('theBenchmark.p',prove_ax_glb1c) ).
cnf(c_26,plain,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
inference(clausify,[status(thm)],[prove_ax_glb1c]) ).
cnf(c_27,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) != greatest_lower_bound(a,b),
inference(paramod,[status(thm)],[c_5,c_26]) ).
cnf(c_39,plain,
least_upper_bound(A,greatest_lower_bound(B,A)) = A,
inference(paramod,[status(thm)],[c_4,c_12]) ).
cnf(c_438,plain,
greatest_lower_bound(c,A) = greatest_lower_bound(c,greatest_lower_bound(a,A)),
inference(paramod,[status(thm)],[c_23,c_7]) ).
cnf(c_67,plain,
greatest_lower_bound(c,greatest_lower_bound(a,A)) = greatest_lower_bound(c,A),
inference(copy,[status(thm)],[c_438]) ).
cnf(c_439,plain,
least_upper_bound(greatest_lower_bound(a,A),greatest_lower_bound(c,A)) = greatest_lower_bound(a,A),
inference(paramod,[status(thm)],[c_67,c_39]) ).
cnf(c_397,plain,
least_upper_bound(greatest_lower_bound(c,A),greatest_lower_bound(a,A)) = greatest_lower_bound(a,A),
inference(paramod,[status(thm)],[c_5,c_439]) ).
cnf(c_440,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) = greatest_lower_bound(a,b),
inference(paramod,[status(thm)],[c_25,c_397]) ).
cnf(c_437,plain,
$false,
inference(resolve,[status(thm)],[c_27,c_440]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP140-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 14:31:35 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 3383846 was started by sandbox2 on n004,
% 0.10/0.36 % Fri Sep 25 14:31:35 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.14/0.48
% 0.14/0.48 % Assigning unary symbol inverse kb_weight 0 and highest precedence (9).
% 0.14/0.48
% 0.14/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.48
% 0.14/0.48 % Proof 1 at 0.07 (+ 0.03) seconds.
% 0.14/0.48 % Length of proof is 15.
% 0.14/0.48 % Level of proof is 4.
% 0.14/0.48 % Maximum clause weight is 36.000.
% 0.14/0.48 % Given clauses 56.
% 0.14/0.48
% 0.14/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------