%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP182-4 : 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 : n017.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:16 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 9 unt; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 1 sgn 4 !; 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(glb_absorbtion,axiom,
! [VAR_0,VAR_1] : greatest_lower_bound(VAR_0,least_upper_bound(VAR_0,VAR_1)) = VAR_0,
file('theBenchmark.p',glb_absorbtion) ).
cnf(c_13,plain,
greatest_lower_bound(A,least_upper_bound(A,B)) = A,
inference(clausify,[status(thm)],[glb_absorbtion]) ).
fof(prove_p17b,axiom,
greatest_lower_bound(identity,least_upper_bound(a,identity)) != identity,
file('theBenchmark.p',prove_p17b) ).
cnf(c_25,plain,
greatest_lower_bound(identity,least_upper_bound(a,identity)) != identity,
inference(clausify,[status(thm)],[prove_p17b]) ).
cnf(c_27,plain,
greatest_lower_bound(identity,least_upper_bound(identity,a)) != identity,
inference(paramod,[status(thm)],[c_5,c_25]) ).
cnf(c_28,plain,
identity != identity,
inference(paramod,[status(thm)],[c_13,c_27]) ).
cnf(c_26,plain,
$false,
inference(copy,[status(thm)],[c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP182-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n017.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:30:32 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.14/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.36 % Process 2487575 was started by sandbox on n017,
% 0.14/0.36 % Fri Sep 25 14:30:32 2026
% 0.14/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.37
% 0.14/0.37 % From the command line: assign(max_seconds, 300).
% 0.14/0.38
% 0.14/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.38
% 0.14/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/0.38 % Length of proof is 4.
% 0.14/0.38 % Level of proof is 1.
% 0.14/0.38 % Maximum clause weight is 7.000.
% 0.14/0.38 % Given clauses 0.
% 0.14/0.38
% 0.14/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------