%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP149-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.09s 0.40s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 8 ( 8 ~; 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 : 32 ( 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_lub,axiom,
! [VAR_0,VAR_1,VAR_2] : least_upper_bound(VAR_0,least_upper_bound(VAR_1,VAR_2)) = least_upper_bound(least_upper_bound(VAR_0,VAR_1),VAR_2),
file('theBenchmark.p',associativity_of_lub) ).
cnf(c_8,plain,
least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C),
inference(clausify,[status(thm)],[associativity_of_lub]) ).
cnf(c_9,plain,
least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)),
inference(copy,[status(thm)],[c_8]) ).
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_lub1d_1,axiom,
greatest_lower_bound(a,c) = a,
file('theBenchmark.p',ax_lub1d_1) ).
cnf(c_22,plain,
greatest_lower_bound(a,c) = a,
inference(clausify,[status(thm)],[ax_lub1d_1]) ).
fof(ax_lub1d_2,axiom,
greatest_lower_bound(b,c) = b,
file('theBenchmark.p',ax_lub1d_2) ).
cnf(c_23,plain,
greatest_lower_bound(b,c) = b,
inference(clausify,[status(thm)],[ax_lub1d_2]) ).
fof(prove_ax_lub1d,axiom,
least_upper_bound(least_upper_bound(a,b),c) != c,
file('theBenchmark.p',prove_ax_lub1d) ).
cnf(c_24,plain,
least_upper_bound(least_upper_bound(a,b),c) != c,
inference(clausify,[status(thm)],[prove_ax_lub1d]) ).
cnf(c_25,plain,
least_upper_bound(c,least_upper_bound(a,b)) != c,
inference(paramod,[status(thm)],[c_5,c_24]) ).
cnf(c_29,plain,
least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(C,least_upper_bound(A,B)),
inference(paramod,[status(thm)],[c_9,c_5]) ).
cnf(c_94,plain,
least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(B,least_upper_bound(A,C)),
inference(paramod,[status(thm)],[c_5,c_9]) ).
cnf(c_30,plain,
least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(B,least_upper_bound(A,C)),
inference(paramod,[status(thm)],[c_9,c_94]) ).
cnf(c_95,plain,
least_upper_bound(b,least_upper_bound(c,a)) != c,
inference(paramod,[status(thm)],[c_29,c_25]) ).
cnf(c_96,plain,
least_upper_bound(b,least_upper_bound(a,c)) != c,
inference(paramod,[status(thm)],[c_5,c_95]) ).
cnf(c_31,plain,
least_upper_bound(a,least_upper_bound(b,c)) != c,
inference(paramod,[status(thm)],[c_30,c_96]) ).
cnf(c_38,plain,
least_upper_bound(A,greatest_lower_bound(B,A)) = A,
inference(paramod,[status(thm)],[c_4,c_12]) ).
cnf(c_97,plain,
least_upper_bound(c,a) = c,
inference(paramod,[status(thm)],[c_22,c_38]) ).
cnf(c_91,plain,
least_upper_bound(a,c) = c,
inference(paramod,[status(thm)],[c_5,c_97]) ).
cnf(c_98,plain,
least_upper_bound(c,b) = c,
inference(paramod,[status(thm)],[c_23,c_38]) ).
cnf(c_92,plain,
least_upper_bound(b,c) = c,
inference(paramod,[status(thm)],[c_5,c_98]) ).
cnf(c_99,plain,
least_upper_bound(a,c) != c,
inference(paramod,[status(thm)],[c_92,c_31]) ).
cnf(c_100,plain,
c != c,
inference(paramod,[status(thm)],[c_91,c_99]) ).
cnf(c_93,plain,
$false,
inference(copy,[status(thm)],[c_100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP149-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.09/0.37 % Computer : n014.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 14:32:02 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 430330 was started by sandbox on n014,
% 0.09/0.37 % Fri Sep 25 14:32:02 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.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.09/0.40
% 0.09/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.40
% 0.09/0.40 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.40 % Length of proof is 16.
% 0.09/0.40 % Level of proof is 4.
% 0.09/0.40 % Maximum clause weight is 11.000.
% 0.09/0.40 % Given clauses 22.
% 0.09/0.40
% 0.09/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------