%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP139-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:06 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 19 unt; 0 def)
% Number of atoms : 19 ( 18 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 5 !; 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(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(ax_glb1b_1_1,axiom,
greatest_lower_bound(a,c) = c,
file('theBenchmark.p',ax_glb1b_1_1) ).
cnf(c_22,plain,
greatest_lower_bound(a,c) = c,
inference(clausify,[status(thm)],[ax_glb1b_1_1]) ).
cnf(c_23,plain,
greatest_lower_bound(c,a) = c,
inference(paramod,[status(thm)],[c_4,c_22]) ).
fof(ax_glb1b_2_2,axiom,
greatest_lower_bound(b,c) = c,
file('theBenchmark.p',ax_glb1b_2_2) ).
cnf(c_24,plain,
greatest_lower_bound(b,c) = c,
inference(clausify,[status(thm)],[ax_glb1b_2_2]) ).
cnf(c_25,plain,
greatest_lower_bound(c,b) = c,
inference(paramod,[status(thm)],[c_4,c_24]) ).
fof(prove_ax_glb1b,axiom,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
file('theBenchmark.p',prove_ax_glb1b) ).
cnf(c_26,plain,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
inference(clausify,[status(thm)],[prove_ax_glb1b]) ).
cnf(c_27,plain,
greatest_lower_bound(c,greatest_lower_bound(a,b)) != c,
inference(paramod,[status(thm)],[c_4,c_26]) ).
cnf(c_70,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_70]) ).
cnf(c_71,plain,
greatest_lower_bound(c,b) != c,
inference(paramod,[status(thm)],[c_67,c_27]) ).
cnf(c_72,plain,
c != c,
inference(paramod,[status(thm)],[c_25,c_71]) ).
cnf(c_69,plain,
$false,
inference(copy,[status(thm)],[c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP139-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.35 % Computer : n001.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 14:37:25 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 3532802 was started by sandbox on n001,
% 0.08/0.35 % Fri Sep 25 14:37:25 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.37
% 0.13/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.37
% 0.13/0.37 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.13/0.37 % Length of proof is 11.
% 0.13/0.37 % Level of proof is 3.
% 0.13/0.37 % Maximum clause weight is 11.000.
% 0.13/0.37 % Given clauses 16.
% 0.13/0.37
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------