%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP137-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 : n006.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.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax_antisymb_1,axiom,
greatest_lower_bound(a,b) = a,
file('theBenchmark.p',ax_antisymb_1) ).
cnf(c_22,plain,
greatest_lower_bound(a,b) = a,
inference(clausify,[status(thm)],[ax_antisymb_1]) ).
fof(ax_antisymb_2,axiom,
greatest_lower_bound(a,b) = b,
file('theBenchmark.p',ax_antisymb_2) ).
cnf(c_23,plain,
greatest_lower_bound(a,b) = b,
inference(clausify,[status(thm)],[ax_antisymb_2]) ).
cnf(c_27,plain,
a = b,
inference(paramod,[status(thm)],[c_22,c_23]) ).
cnf(c_24,plain,
b = a,
inference(copy,[status(thm)],[c_27]) ).
fof(prove_ax_antisymb,axiom,
a != b,
file('theBenchmark.p',prove_ax_antisymb) ).
cnf(c_25,plain,
a != b,
inference(clausify,[status(thm)],[prove_ax_antisymb]) ).
cnf(c_28,plain,
a != a,
inference(paramod,[status(thm)],[c_24,c_25]) ).
cnf(c_26,plain,
$false,
inference(copy,[status(thm)],[c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP137-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.10/0.43 % Computer : n006.cluster.edu
% 0.10/0.43 % Model : x86_64 x86_64
% 0.10/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.43 % Memory : 8046.5625MB
% 0.10/0.43 % OS : Linux 6.8.0-71-generic
% 0.10/0.43 % CPULimit : 300
% 0.10/0.43 % WCLimit : 300
% 0.10/0.43 % DateTime : Fri Sep 25 14:31:10 UTC 2026
% 0.10/0.43 % CPUTime :
% 0.10/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.43 % Process 3112350 was started by sandbox on n006,
% 0.10/0.43 % Fri Sep 25 14:31:10 2026
% 0.10/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.44
% 0.10/0.44 % From the command line: assign(max_seconds, 300).
% 0.10/0.46
% 0.10/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.46
% 0.10/0.46 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.46 % Length of proof is 5.
% 0.10/0.46 % Level of proof is 2.
% 0.10/0.46 % Maximum clause weight is 5.000.
% 0.10/0.46 % Given clauses 0.
% 0.10/0.46
% 0.10/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------