%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP167-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:11 AM UTC 2026
% Result : Unsatisfiable 7.41s 2.57s
% Output : CNFRefutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 17
% Syntax : Number of formulae : 108 ( 108 unt; 0 def)
% Number of atoms : 108 ( 107 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 185 ( 6 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_identity,axiom,
! [VAR_0] : multiply(identity,VAR_0) = VAR_0,
file('theBenchmark.p',left_identity) ).
cnf(c_1,plain,
multiply(identity,A) = A,
inference(clausify,[status(thm)],[left_identity]) ).
fof(left_inverse,axiom,
! [VAR_0] : multiply(inverse(VAR_0),VAR_0) = identity,
file('theBenchmark.p',left_inverse) ).
cnf(c_2,plain,
multiply(inverse(A),A) = identity,
inference(clausify,[status(thm)],[left_inverse]) ).
fof(associativity,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(multiply(VAR_0,VAR_1),VAR_2) = multiply(VAR_0,multiply(VAR_1,VAR_2)),
file('theBenchmark.p',associativity) ).
cnf(c_3,plain,
multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
inference(clausify,[status(thm)],[associativity]) ).
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(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(monotony_lub1,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,least_upper_bound(VAR_1,VAR_2)) = least_upper_bound(multiply(VAR_0,VAR_1),multiply(VAR_0,VAR_2)),
file('theBenchmark.p',monotony_lub1) ).
cnf(c_14,plain,
multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)),
inference(clausify,[status(thm)],[monotony_lub1]) ).
cnf(c_15,plain,
least_upper_bound(multiply(A,B),multiply(A,C)) = multiply(A,least_upper_bound(B,C)),
inference(copy,[status(thm)],[c_14]) ).
fof(monotony_glb1,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,greatest_lower_bound(VAR_1,VAR_2)) = greatest_lower_bound(multiply(VAR_0,VAR_1),multiply(VAR_0,VAR_2)),
file('theBenchmark.p',monotony_glb1) ).
cnf(c_16,plain,
multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)),
inference(clausify,[status(thm)],[monotony_glb1]) ).
cnf(c_17,plain,
greatest_lower_bound(multiply(A,B),multiply(A,C)) = multiply(A,greatest_lower_bound(B,C)),
inference(copy,[status(thm)],[c_16]) ).
fof(monotony_lub2,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(least_upper_bound(VAR_0,VAR_1),VAR_2) = least_upper_bound(multiply(VAR_0,VAR_2),multiply(VAR_1,VAR_2)),
file('theBenchmark.p',monotony_lub2) ).
cnf(c_18,plain,
multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)),
inference(clausify,[status(thm)],[monotony_lub2]) ).
cnf(c_19,plain,
least_upper_bound(multiply(A,B),multiply(C,B)) = multiply(least_upper_bound(A,C),B),
inference(copy,[status(thm)],[c_18]) ).
fof(monotony_glb2,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(greatest_lower_bound(VAR_0,VAR_1),VAR_2) = greatest_lower_bound(multiply(VAR_0,VAR_2),multiply(VAR_1,VAR_2)),
file('theBenchmark.p',monotony_glb2) ).
cnf(c_20,plain,
multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)),
inference(clausify,[status(thm)],[monotony_glb2]) ).
cnf(c_21,plain,
greatest_lower_bound(multiply(A,B),multiply(C,B)) = multiply(greatest_lower_bound(A,C),B),
inference(copy,[status(thm)],[c_20]) ).
fof(lat4_1,axiom,
! [VAR_0] : positive_part(VAR_0) = least_upper_bound(VAR_0,identity),
file('theBenchmark.p',lat4_1) ).
cnf(c_22,plain,
positive_part(A) = least_upper_bound(A,identity),
inference(clausify,[status(thm)],[lat4_1]) ).
fof(lat4_2,axiom,
! [VAR_0] : negative_part(VAR_0) = greatest_lower_bound(VAR_0,identity),
file('theBenchmark.p',lat4_2) ).
cnf(c_23,plain,
negative_part(A) = greatest_lower_bound(A,identity),
inference(clausify,[status(thm)],[lat4_2]) ).
fof(lat4_3,axiom,
! [VAR_0,VAR_1,VAR_2] : least_upper_bound(VAR_0,greatest_lower_bound(VAR_1,VAR_2)) = greatest_lower_bound(least_upper_bound(VAR_0,VAR_1),least_upper_bound(VAR_0,VAR_2)),
file('theBenchmark.p',lat4_3) ).
cnf(c_24,plain,
least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)),
inference(clausify,[status(thm)],[lat4_3]) ).
cnf(c_25,plain,
greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)) = least_upper_bound(A,greatest_lower_bound(B,C)),
inference(copy,[status(thm)],[c_24]) ).
fof(lat4_4,axiom,
! [VAR_0,VAR_1,VAR_2] : greatest_lower_bound(VAR_0,least_upper_bound(VAR_1,VAR_2)) = least_upper_bound(greatest_lower_bound(VAR_0,VAR_1),greatest_lower_bound(VAR_0,VAR_2)),
file('theBenchmark.p',lat4_4) ).
cnf(c_26,plain,
greatest_lower_bound(A,least_upper_bound(B,C)) = least_upper_bound(greatest_lower_bound(A,B),greatest_lower_bound(A,C)),
inference(clausify,[status(thm)],[lat4_4]) ).
cnf(c_27,plain,
least_upper_bound(greatest_lower_bound(A,B),greatest_lower_bound(A,C)) = greatest_lower_bound(A,least_upper_bound(B,C)),
inference(copy,[status(thm)],[c_26]) ).
fof(prove_lat4,axiom,
a != multiply(positive_part(a),negative_part(a)),
file('theBenchmark.p',prove_lat4) ).
cnf(c_28,plain,
a != multiply(positive_part(a),negative_part(a)),
inference(clausify,[status(thm)],[prove_lat4]) ).
cnf(c_3788,plain,
a != multiply(least_upper_bound(a,identity),negative_part(a)),
inference(paramod,[status(thm)],[c_22,c_28]) ).
cnf(c_3789,plain,
a != multiply(least_upper_bound(identity,a),negative_part(a)),
inference(paramod,[status(thm)],[c_5,c_3788]) ).
cnf(c_3790,plain,
a != multiply(least_upper_bound(identity,a),greatest_lower_bound(a,identity)),
inference(paramod,[status(thm)],[c_23,c_3789]) ).
cnf(c_3791,plain,
a != multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a)),
inference(paramod,[status(thm)],[c_4,c_3790]) ).
cnf(c_29,plain,
multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a)) != a,
inference(copy,[status(thm)],[c_3791]) ).
cnf(c_3792,plain,
multiply(identity,A) = multiply(inverse(B),multiply(B,A)),
inference(paramod,[status(thm)],[c_2,c_3]) ).
cnf(c_3793,plain,
A = multiply(inverse(B),multiply(B,A)),
inference(paramod,[status(thm)],[c_1,c_3792]) ).
cnf(c_30,plain,
multiply(inverse(A),multiply(A,B)) = B,
inference(copy,[status(thm)],[c_3793]) ).
cnf(c_3794,plain,
least_upper_bound(A,B) = least_upper_bound(A,least_upper_bound(greatest_lower_bound(A,C),B)),
inference(paramod,[status(thm)],[c_12,c_9]) ).
cnf(c_42,plain,
least_upper_bound(A,least_upper_bound(greatest_lower_bound(A,B),C)) = least_upper_bound(A,C),
inference(copy,[status(thm)],[c_3794]) ).
cnf(c_44,plain,
greatest_lower_bound(A,least_upper_bound(B,A)) = A,
inference(paramod,[status(thm)],[c_5,c_13]) ).
cnf(c_3795,plain,
least_upper_bound(multiply(inverse(A),B),identity) = multiply(inverse(A),least_upper_bound(B,A)),
inference(paramod,[status(thm)],[c_2,c_15]) ).
cnf(c_48,plain,
least_upper_bound(identity,multiply(inverse(A),B)) = multiply(inverse(A),least_upper_bound(B,A)),
inference(paramod,[status(thm)],[c_5,c_3795]) ).
cnf(c_53,plain,
least_upper_bound(A,multiply(B,A)) = multiply(least_upper_bound(identity,B),A),
inference(paramod,[status(thm)],[c_1,c_19]) ).
cnf(c_60,plain,
greatest_lower_bound(A,multiply(B,A)) = multiply(greatest_lower_bound(identity,B),A),
inference(paramod,[status(thm)],[c_1,c_21]) ).
cnf(c_68,plain,
greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(C,A)) = least_upper_bound(A,greatest_lower_bound(B,C)),
inference(paramod,[status(thm)],[c_5,c_25]) ).
cnf(c_75,plain,
least_upper_bound(greatest_lower_bound(A,B),greatest_lower_bound(B,C)) = greatest_lower_bound(B,least_upper_bound(A,C)),
inference(paramod,[status(thm)],[c_4,c_27]) ).
cnf(c_90,plain,
multiply(inverse(inverse(A)),identity) = A,
inference(paramod,[status(thm)],[c_2,c_30]) ).
cnf(c_100,plain,
multiply(inverse(inverse(A)),B) = multiply(A,B),
inference(paramod,[status(thm)],[c_30,c_30]) ).
cnf(c_101,plain,
multiply(A,identity) = A,
inference(paramod,[status(thm)],[c_100,c_90]) ).
cnf(c_103,plain,
least_upper_bound(A,multiply(A,B)) = multiply(A,least_upper_bound(identity,B)),
inference(paramod,[status(thm)],[c_101,c_15]) ).
cnf(c_105,plain,
greatest_lower_bound(A,multiply(A,B)) = multiply(A,greatest_lower_bound(identity,B)),
inference(paramod,[status(thm)],[c_101,c_17]) ).
cnf(c_3796,plain,
least_upper_bound(greatest_lower_bound(identity,a),multiply(a,greatest_lower_bound(identity,a))) != a,
inference(paramod,[status(thm)],[c_53,c_29]) ).
cnf(c_3797,plain,
least_upper_bound(greatest_lower_bound(identity,a),greatest_lower_bound(a,multiply(a,a))) != a,
inference(paramod,[status(thm)],[c_105,c_3796]) ).
cnf(c_132,plain,
greatest_lower_bound(a,least_upper_bound(identity,multiply(a,a))) != a,
inference(paramod,[status(thm)],[c_75,c_3797]) ).
cnf(c_201,plain,
greatest_lower_bound(A,multiply(A,least_upper_bound(identity,B))) = A,
inference(paramod,[status(thm)],[c_103,c_13]) ).
cnf(c_3798,plain,
multiply(A,least_upper_bound(identity,A)) = multiply(least_upper_bound(identity,A),A),
inference(paramod,[status(thm)],[c_103,c_53]) ).
cnf(c_214,plain,
multiply(least_upper_bound(identity,A),A) = multiply(A,least_upper_bound(identity,A)),
inference(copy,[status(thm)],[c_3798]) ).
cnf(c_3799,plain,
greatest_lower_bound(inverse(A),identity) = multiply(inverse(A),greatest_lower_bound(identity,A)),
inference(paramod,[status(thm)],[c_2,c_105]) ).
cnf(c_3800,plain,
greatest_lower_bound(identity,inverse(A)) = multiply(inverse(A),greatest_lower_bound(identity,A)),
inference(paramod,[status(thm)],[c_4,c_3799]) ).
cnf(c_240,plain,
multiply(inverse(A),greatest_lower_bound(identity,A)) = greatest_lower_bound(identity,inverse(A)),
inference(copy,[status(thm)],[c_3800]) ).
cnf(c_3801,plain,
multiply(A,greatest_lower_bound(identity,A)) = multiply(greatest_lower_bound(identity,A),A),
inference(paramod,[status(thm)],[c_105,c_60]) ).
cnf(c_262,plain,
multiply(greatest_lower_bound(identity,A),A) = multiply(A,greatest_lower_bound(identity,A)),
inference(copy,[status(thm)],[c_3801]) ).
cnf(c_3802,plain,
greatest_lower_bound(least_upper_bound(identity,A),multiply(A,least_upper_bound(identity,A))) = multiply(least_upper_bound(identity,A),greatest_lower_bound(identity,A)),
inference(paramod,[status(thm)],[c_214,c_105]) ).
cnf(c_3803,plain,
multiply(greatest_lower_bound(identity,A),least_upper_bound(identity,A)) = multiply(least_upper_bound(identity,A),greatest_lower_bound(identity,A)),
inference(paramod,[status(thm)],[c_60,c_3802]) ).
cnf(c_322,plain,
multiply(least_upper_bound(identity,A),greatest_lower_bound(identity,A)) = multiply(greatest_lower_bound(identity,A),least_upper_bound(identity,A)),
inference(copy,[status(thm)],[c_3803]) ).
cnf(c_3804,plain,
multiply(inverse(least_upper_bound(identity,A)),identity) = greatest_lower_bound(identity,inverse(least_upper_bound(identity,A))),
inference(paramod,[status(thm)],[c_13,c_240]) ).
cnf(c_3805,plain,
inverse(least_upper_bound(identity,A)) = greatest_lower_bound(identity,inverse(least_upper_bound(identity,A))),
inference(paramod,[status(thm)],[c_101,c_3804]) ).
cnf(c_343,plain,
greatest_lower_bound(identity,inverse(least_upper_bound(identity,A))) = inverse(least_upper_bound(identity,A)),
inference(copy,[status(thm)],[c_3805]) ).
cnf(c_3806,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(A,B),A),least_upper_bound(C,greatest_lower_bound(A,B))) = greatest_lower_bound(A,least_upper_bound(B,C)),
inference(paramod,[status(thm)],[c_27,c_68]) ).
cnf(c_3807,plain,
greatest_lower_bound(least_upper_bound(A,greatest_lower_bound(A,B)),least_upper_bound(C,greatest_lower_bound(A,B))) = greatest_lower_bound(A,least_upper_bound(B,C)),
inference(paramod,[status(thm)],[c_5,c_3806]) ).
cnf(c_421,plain,
greatest_lower_bound(A,least_upper_bound(B,greatest_lower_bound(A,C))) = greatest_lower_bound(A,least_upper_bound(C,B)),
inference(paramod,[status(thm)],[c_12,c_3807]) ).
cnf(c_592,plain,
least_upper_bound(A,multiply(greatest_lower_bound(A,B),least_upper_bound(identity,C))) = least_upper_bound(A,multiply(greatest_lower_bound(A,B),C)),
inference(paramod,[status(thm)],[c_103,c_42]) ).
cnf(c_940,plain,
least_upper_bound(greatest_lower_bound(identity,A),inverse(least_upper_bound(identity,B))) = greatest_lower_bound(identity,least_upper_bound(A,inverse(least_upper_bound(identity,B)))),
inference(paramod,[status(thm)],[c_343,c_27]) ).
cnf(c_3808,plain,
multiply(A,identity) = inverse(inverse(A)),
inference(paramod,[status(thm)],[c_100,c_101]) ).
cnf(c_3809,plain,
A = inverse(inverse(A)),
inference(paramod,[status(thm)],[c_101,c_3808]) ).
cnf(c_3255,plain,
inverse(inverse(A)) = A,
inference(copy,[status(thm)],[c_3809]) ).
cnf(c_3810,plain,
least_upper_bound(identity,multiply(A,B)) = multiply(inverse(inverse(A)),least_upper_bound(B,inverse(A))),
inference(paramod,[status(thm)],[c_100,c_48]) ).
cnf(c_3811,plain,
least_upper_bound(identity,multiply(A,B)) = multiply(A,least_upper_bound(B,inverse(A))),
inference(paramod,[status(thm)],[c_3255,c_3810]) ).
cnf(c_3261,plain,
multiply(A,least_upper_bound(B,inverse(A))) = least_upper_bound(identity,multiply(A,B)),
inference(copy,[status(thm)],[c_3811]) ).
cnf(c_3812,plain,
greatest_lower_bound(A,least_upper_bound(identity,multiply(A,B))) = multiply(A,greatest_lower_bound(identity,least_upper_bound(B,inverse(A)))),
inference(paramod,[status(thm)],[c_3261,c_105]) ).
cnf(c_3693,plain,
multiply(A,greatest_lower_bound(identity,least_upper_bound(B,inverse(A)))) = greatest_lower_bound(A,least_upper_bound(identity,multiply(A,B))),
inference(copy,[status(thm)],[c_3812]) ).
cnf(c_3813,plain,
multiply(least_upper_bound(identity,A),least_upper_bound(greatest_lower_bound(identity,A),inverse(least_upper_bound(identity,A)))) = least_upper_bound(identity,multiply(greatest_lower_bound(identity,A),least_upper_bound(identity,A))),
inference(paramod,[status(thm)],[c_322,c_3261]) ).
cnf(c_3814,plain,
multiply(least_upper_bound(identity,A),greatest_lower_bound(identity,least_upper_bound(A,inverse(least_upper_bound(identity,A))))) = least_upper_bound(identity,multiply(greatest_lower_bound(identity,A),least_upper_bound(identity,A))),
inference(paramod,[status(thm)],[c_940,c_3813]) ).
cnf(c_3815,plain,
greatest_lower_bound(least_upper_bound(identity,A),least_upper_bound(identity,multiply(least_upper_bound(identity,A),A))) = least_upper_bound(identity,multiply(greatest_lower_bound(identity,A),least_upper_bound(identity,A))),
inference(paramod,[status(thm)],[c_3693,c_3814]) ).
cnf(c_3816,plain,
greatest_lower_bound(least_upper_bound(identity,A),least_upper_bound(identity,multiply(A,least_upper_bound(identity,A)))) = least_upper_bound(identity,multiply(greatest_lower_bound(identity,A),least_upper_bound(identity,A))),
inference(paramod,[status(thm)],[c_214,c_3815]) ).
cnf(c_3817,plain,
least_upper_bound(identity,greatest_lower_bound(A,multiply(A,least_upper_bound(identity,A)))) = least_upper_bound(identity,multiply(greatest_lower_bound(identity,A),least_upper_bound(identity,A))),
inference(paramod,[status(thm)],[c_25,c_3816]) ).
cnf(c_3818,plain,
least_upper_bound(identity,A) = least_upper_bound(identity,multiply(greatest_lower_bound(identity,A),least_upper_bound(identity,A))),
inference(paramod,[status(thm)],[c_201,c_3817]) ).
cnf(c_3819,plain,
least_upper_bound(identity,A) = least_upper_bound(identity,multiply(greatest_lower_bound(identity,A),A)),
inference(paramod,[status(thm)],[c_592,c_3818]) ).
cnf(c_3820,plain,
least_upper_bound(identity,A) = least_upper_bound(identity,multiply(A,greatest_lower_bound(identity,A))),
inference(paramod,[status(thm)],[c_262,c_3819]) ).
cnf(c_3694,plain,
least_upper_bound(identity,multiply(A,greatest_lower_bound(identity,A))) = least_upper_bound(identity,A),
inference(copy,[status(thm)],[c_3820]) ).
cnf(c_3712,plain,
least_upper_bound(identity,greatest_lower_bound(A,multiply(A,A))) = least_upper_bound(identity,A),
inference(paramod,[status(thm)],[c_105,c_3694]) ).
cnf(c_3821,plain,
greatest_lower_bound(A,least_upper_bound(identity,A)) = greatest_lower_bound(A,least_upper_bound(multiply(A,A),identity)),
inference(paramod,[status(thm)],[c_3712,c_421]) ).
cnf(c_3822,plain,
A = greatest_lower_bound(A,least_upper_bound(multiply(A,A),identity)),
inference(paramod,[status(thm)],[c_44,c_3821]) ).
cnf(c_3823,plain,
A = greatest_lower_bound(A,least_upper_bound(identity,multiply(A,A))),
inference(paramod,[status(thm)],[c_5,c_3822]) ).
cnf(c_3786,plain,
greatest_lower_bound(A,least_upper_bound(identity,multiply(A,A))) = A,
inference(copy,[status(thm)],[c_3823]) ).
cnf(c_3787,plain,
$false,
inference(resolve,[status(thm)],[c_3786,c_132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP167-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.40 % Computer : n014.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8046.5625MB
% 0.10/0.40 % OS : Linux 6.8.0-71-generic
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Fri Sep 25 14:33:03 UTC 2026
% 0.10/0.41 % CPUTime :
% 0.10/0.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.41 % Process 432490 was started by sandbox on n014,
% 0.10/0.41 % Fri Sep 25 14:33:03 2026
% 0.10/0.41 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.41
% 0.14/0.41 % From the command line: assign(max_seconds, 300).
% 7.41/2.57
% 7.41/2.57 % SZS status Unsatisfiable for theBenchmark
% 7.41/2.57
% 7.41/2.57 % Proof 1 at 0.71 (+ 0.22) seconds.
% 7.41/2.57 % Length of proof is 55.
% 7.41/2.57 % Level of proof is 11.
% 7.41/2.57 % Maximum clause weight is 42.000.
% 7.41/2.57 % Given clauses 181.
% 7.41/2.57
% 7.41/2.57 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------