↑ Up

Prover9---2026-6A.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : BOO025-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n010.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 06:55:08 AM UTC 2026

% Result   : Unsatisfiable 0.13s 10.53s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   54
%            Number of leaves      :    8
% Syntax   : Number of formulae    :  134 ( 134 unt;   0 def)
%            Number of atoms       :  134 ( 133 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   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    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :  227 (  66 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(multiply_add,axiom,
    ! [VAR_0,VAR_1] : multiply(add(VAR_0,VAR_1),VAR_1) = VAR_1,
    file('theBenchmark.p',multiply_add) ).

cnf(c_1,plain,
    multiply(add(A,B),B) = B,
    inference(clausify,[status(thm)],[multiply_add]) ).

fof(multiply_add_property,axiom,
    ! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,add(VAR_1,VAR_2)) = add(multiply(VAR_1,VAR_0),multiply(VAR_2,VAR_0)),
    file('theBenchmark.p',multiply_add_property) ).

cnf(c_2,plain,
    multiply(A,add(B,C)) = add(multiply(B,A),multiply(C,A)),
    inference(clausify,[status(thm)],[multiply_add_property]) ).

cnf(c_3,plain,
    add(multiply(A,B),multiply(C,B)) = multiply(B,add(A,C)),
    inference(copy,[status(thm)],[c_2]) ).

fof(additive_inverse,axiom,
    ! [VAR_0] : add(VAR_0,inverse(VAR_0)) = n1,
    file('theBenchmark.p',additive_inverse) ).

cnf(c_4,plain,
    add(A,inverse(A)) = n1,
    inference(clausify,[status(thm)],[additive_inverse]) ).

fof(pixley_defn,axiom,
    ! [VAR_0,VAR_1,VAR_2] : pixley(VAR_0,VAR_1,VAR_2) = add(multiply(VAR_0,inverse(VAR_1)),add(multiply(VAR_0,VAR_2),multiply(inverse(VAR_1),VAR_2))),
    file('theBenchmark.p',pixley_defn) ).

cnf(c_5,plain,
    pixley(A,B,C) = add(multiply(A,inverse(B)),add(multiply(A,C),multiply(inverse(B),C))),
    inference(clausify,[status(thm)],[pixley_defn]) ).

cnf(c_6,plain,
    pixley(A,B,C) = add(multiply(A,inverse(B)),multiply(C,add(A,inverse(B)))),
    inference(paramod,[status(thm)],[c_3,c_5]) ).

fof(pixley1,axiom,
    ! [VAR_0,VAR_1] : pixley(VAR_0,VAR_0,VAR_1) = VAR_1,
    file('theBenchmark.p',pixley1) ).

cnf(c_7,plain,
    pixley(A,A,B) = B,
    inference(clausify,[status(thm)],[pixley1]) ).

cnf(c_433,plain,
    add(multiply(A,inverse(A)),multiply(B,add(A,inverse(A)))) = B,
    inference(paramod,[status(thm)],[c_6,c_7]) ).

cnf(c_8,plain,
    add(multiply(A,inverse(A)),multiply(B,n1)) = B,
    inference(paramod,[status(thm)],[c_4,c_433]) ).

fof(pixley2,axiom,
    ! [VAR_0,VAR_1] : pixley(VAR_0,VAR_1,VAR_1) = VAR_0,
    file('theBenchmark.p',pixley2) ).

cnf(c_9,plain,
    pixley(A,B,B) = A,
    inference(clausify,[status(thm)],[pixley2]) ).

cnf(c_10,plain,
    add(multiply(A,inverse(B)),multiply(B,add(A,inverse(B)))) = A,
    inference(paramod,[status(thm)],[c_6,c_9]) ).

fof(pixley3,axiom,
    ! [VAR_0,VAR_1] : pixley(VAR_0,VAR_1,VAR_0) = VAR_0,
    file('theBenchmark.p',pixley3) ).

cnf(c_11,plain,
    pixley(A,B,A) = A,
    inference(clausify,[status(thm)],[pixley3]) ).

cnf(c_12,plain,
    add(multiply(A,inverse(B)),multiply(A,add(A,inverse(B)))) = A,
    inference(paramod,[status(thm)],[c_6,c_11]) ).

fof(prove_equal_identity,axiom,
    multiply(b,inverse(b)) != multiply(a,inverse(a)),
    file('theBenchmark.p',prove_equal_identity) ).

cnf(c_13,plain,
    multiply(b,inverse(b)) != multiply(a,inverse(a)),
    inference(clausify,[status(thm)],[prove_equal_identity]) ).

cnf(c_14,plain,
    multiply(multiply(A,add(B,C)),multiply(C,A)) = multiply(C,A),
    inference(paramod,[status(thm)],[c_3,c_1]) ).

cnf(c_434,plain,
    add(A,multiply(B,A)) = multiply(A,add(add(C,A),B)),
    inference(paramod,[status(thm)],[c_1,c_3]) ).

cnf(c_15,plain,
    multiply(A,add(add(B,A),C)) = add(A,multiply(C,A)),
    inference(copy,[status(thm)],[c_434]) ).

cnf(c_435,plain,
    add(multiply(A,B),B) = multiply(B,add(A,add(C,B))),
    inference(paramod,[status(thm)],[c_1,c_3]) ).

cnf(c_16,plain,
    multiply(A,add(B,add(C,A))) = add(multiply(B,A),A),
    inference(copy,[status(thm)],[c_435]) ).

cnf(c_18,plain,
    multiply(n1,inverse(A)) = inverse(A),
    inference(paramod,[status(thm)],[c_4,c_1]) ).

cnf(c_19,plain,
    multiply(A,multiply(A,n1)) = multiply(A,n1),
    inference(paramod,[status(thm)],[c_8,c_1]) ).

cnf(c_21,plain,
    multiply(A,multiply(B,add(A,inverse(B)))) = multiply(B,add(A,inverse(B))),
    inference(paramod,[status(thm)],[c_10,c_1]) ).

cnf(c_436,plain,
    multiply(add(A,B),multiply(B,add(C,add(A,B)))) = multiply(B,add(C,add(A,B))),
    inference(paramod,[status(thm)],[c_1,c_14]) ).

cnf(c_437,plain,
    multiply(add(A,B),add(multiply(C,B),B)) = multiply(B,add(C,add(A,B))),
    inference(paramod,[status(thm)],[c_16,c_436]) ).

cnf(c_25,plain,
    multiply(add(A,B),add(multiply(C,B),B)) = add(multiply(C,B),B),
    inference(paramod,[status(thm)],[c_16,c_437]) ).

cnf(c_438,plain,
    add(inverse(A),multiply(B,inverse(A))) = multiply(inverse(A),add(n1,B)),
    inference(paramod,[status(thm)],[c_18,c_3]) ).

cnf(c_33,plain,
    multiply(inverse(A),add(n1,B)) = add(inverse(A),multiply(B,inverse(A))),
    inference(copy,[status(thm)],[c_438]) ).

cnf(c_35,plain,
    add(inverse(n1),multiply(A,n1)) = A,
    inference(paramod,[status(thm)],[c_18,c_8]) ).

cnf(c_39,plain,
    add(inverse(n1),n1) = add(A,n1),
    inference(paramod,[status(thm)],[c_1,c_35]) ).

cnf(c_41,plain,
    add(A,n1) = add(B,n1),
    inference(paramod,[status(thm)],[c_39,c_39]) ).

cnf(c_439,plain,
    add(multiply(A,B),multiply(n1,B)) = multiply(B,add(C,n1)),
    inference(paramod,[status(thm)],[c_41,c_3]) ).

cnf(c_42,plain,
    multiply(A,add(B,n1)) = multiply(A,add(C,n1)),
    inference(paramod,[status(thm)],[c_3,c_439]) ).

cnf(c_44,plain,
    add(multiply(A,add(B,n1)),multiply(C,add(D,n1))) = multiply(add(D,n1),add(A,C)),
    inference(paramod,[status(thm)],[c_42,c_3]) ).

cnf(c_440,plain,
    add(multiply(A,add(B,n1)),multiply(C,add(D,n1))) = multiply(add(B,n1),add(A,C)),
    inference(paramod,[status(thm)],[c_42,c_3]) ).

cnf(c_45,plain,
    multiply(add(A,n1),add(B,C)) = multiply(add(D,n1),add(B,C)),
    inference(paramod,[status(thm)],[c_44,c_440]) ).

cnf(c_57,plain,
    multiply(A,add(B,n1)) = add(A,multiply(n1,A)),
    inference(paramod,[status(thm)],[c_41,c_15]) ).

cnf(c_64,plain,
    multiply(inverse(A),add(B,n1)) = add(inverse(A),inverse(A)),
    inference(paramod,[status(thm)],[c_18,c_57]) ).

cnf(c_441,plain,
    multiply(multiply(n1,n1),add(A,n1)) = add(multiply(n1,n1),multiply(n1,n1)),
    inference(paramod,[status(thm)],[c_19,c_57]) ).

cnf(c_66,plain,
    multiply(multiply(n1,n1),add(A,n1)) = multiply(n1,add(n1,n1)),
    inference(paramod,[status(thm)],[c_3,c_441]) ).

cnf(c_72,plain,
    add(multiply(A,add(B,n1)),add(inverse(C),inverse(C))) = multiply(add(B,n1),add(A,inverse(C))),
    inference(paramod,[status(thm)],[c_64,c_3]) ).

cnf(c_442,plain,
    add(multiply(A,inverse(B)),multiply(n1,inverse(B))) = add(inverse(B),inverse(B)),
    inference(paramod,[status(thm)],[c_64,c_3]) ).

cnf(c_73,plain,
    add(multiply(A,inverse(B)),inverse(B)) = add(inverse(B),inverse(B)),
    inference(paramod,[status(thm)],[c_18,c_442]) ).

cnf(c_77,plain,
    add(multiply(inverse(A),inverse(A)),multiply(inverse(A),multiply(inverse(A),add(B,n1)))) = inverse(A),
    inference(paramod,[status(thm)],[c_64,c_12]) ).

cnf(c_443,plain,
    multiply(add(A,n1),B) = multiply(add(C,n1),add(multiply(D,inverse(D)),multiply(B,n1))),
    inference(paramod,[status(thm)],[c_8,c_45]) ).

cnf(c_86,plain,
    multiply(add(A,n1),B) = multiply(add(C,n1),B),
    inference(paramod,[status(thm)],[c_8,c_443]) ).

cnf(c_444,plain,
    add(multiply(A,add(B,n1)),multiply(n1,add(n1,n1))) = multiply(add(B,n1),add(A,multiply(n1,n1))),
    inference(paramod,[status(thm)],[c_66,c_3]) ).

cnf(c_445,plain,
    multiply(add(n1,n1),add(A,n1)) = multiply(add(B,n1),add(A,multiply(n1,n1))),
    inference(paramod,[status(thm)],[c_44,c_444]) ).

cnf(c_108,plain,
    multiply(add(A,n1),add(B,multiply(n1,n1))) = multiply(add(n1,n1),add(B,n1)),
    inference(copy,[status(thm)],[c_445]) ).

cnf(c_133,plain,
    multiply(inverse(A),add(n1,add(B,n1))) = add(inverse(A),multiply(add(C,n1),inverse(A))),
    inference(paramod,[status(thm)],[c_86,c_33]) ).

cnf(c_446,plain,
    multiply(add(A,B),add(B,B)) = add(multiply(add(C,B),B),B),
    inference(paramod,[status(thm)],[c_1,c_25]) ).

cnf(c_138,plain,
    multiply(add(A,B),add(B,B)) = add(B,B),
    inference(paramod,[status(thm)],[c_1,c_446]) ).

cnf(c_168,plain,
    multiply(add(A,n1),add(B,n1)) = add(n1,n1),
    inference(paramod,[status(thm)],[c_41,c_138]) ).

cnf(c_172,plain,
    multiply(add(A,n1),add(B,multiply(n1,n1))) = add(n1,n1),
    inference(paramod,[status(thm)],[c_168,c_108]) ).

cnf(c_447,plain,
    multiply(add(A,n1),n1) = add(n1,n1),
    inference(paramod,[status(thm)],[c_8,c_172]) ).

cnf(c_448,plain,
    n1 = add(n1,n1),
    inference(paramod,[status(thm)],[c_1,c_447]) ).

cnf(c_197,plain,
    add(n1,n1) = n1,
    inference(copy,[status(thm)],[c_448]) ).

cnf(c_449,plain,
    multiply(add(A,n1),add(B,multiply(n1,n1))) = add(C,n1),
    inference(paramod,[status(thm)],[c_41,c_172]) ).

cnf(c_450,plain,
    add(n1,n1) = add(C,n1),
    inference(paramod,[status(thm)],[c_172,c_449]) ).

cnf(c_451,plain,
    n1 = add(C,n1),
    inference(paramod,[status(thm)],[c_197,c_450]) ).

cnf(c_199,plain,
    add(A,n1) = n1,
    inference(copy,[status(thm)],[c_451]) ).

cnf(c_452,plain,
    multiply(inverse(A),add(n1,n1)) = add(inverse(A),multiply(add(C,n1),inverse(A))),
    inference(paramod,[status(thm)],[c_199,c_133]) ).

cnf(c_453,plain,
    multiply(inverse(A),n1) = add(inverse(A),multiply(add(C,n1),inverse(A))),
    inference(paramod,[status(thm)],[c_199,c_452]) ).

cnf(c_454,plain,
    multiply(inverse(A),n1) = add(inverse(A),multiply(n1,inverse(A))),
    inference(paramod,[status(thm)],[c_199,c_453]) ).

cnf(c_212,plain,
    multiply(inverse(A),n1) = add(inverse(A),inverse(A)),
    inference(paramod,[status(thm)],[c_18,c_454]) ).

cnf(c_455,plain,
    add(multiply(inverse(A),inverse(A)),multiply(inverse(A),multiply(inverse(A),n1))) = inverse(A),
    inference(paramod,[status(thm)],[c_199,c_77]) ).

cnf(c_220,plain,
    add(multiply(inverse(A),inverse(A)),multiply(inverse(A),n1)) = inverse(A),
    inference(paramod,[status(thm)],[c_19,c_455]) ).

cnf(c_456,plain,
    add(multiply(A,n1),add(inverse(C),inverse(C))) = multiply(add(B,n1),add(A,inverse(C))),
    inference(paramod,[status(thm)],[c_199,c_72]) ).

cnf(c_224,plain,
    add(multiply(A,n1),add(inverse(B),inverse(B))) = multiply(n1,add(A,inverse(B))),
    inference(paramod,[status(thm)],[c_199,c_456]) ).

cnf(c_241,plain,
    add(inverse(n1),add(inverse(A),inverse(A))) = inverse(A),
    inference(paramod,[status(thm)],[c_212,c_35]) ).

cnf(c_242,plain,
    multiply(inverse(A),add(inverse(A),inverse(A))) = multiply(inverse(A),n1),
    inference(paramod,[status(thm)],[c_212,c_19]) ).

cnf(c_249,plain,
    add(multiply(inverse(A),inverse(A)),add(inverse(A),inverse(A))) = inverse(A),
    inference(paramod,[status(thm)],[c_212,c_220]) ).

cnf(c_250,plain,
    add(multiply(inverse(A),n1),multiply(B,add(inverse(A),inverse(A)))) = multiply(add(inverse(A),inverse(A)),add(inverse(A),B)),
    inference(paramod,[status(thm)],[c_242,c_3]) ).

cnf(c_457,plain,
    multiply(inverse(A),inverse(A)) = add(multiply(inverse(n1),inverse(A)),inverse(A)),
    inference(paramod,[status(thm)],[c_241,c_16]) ).

cnf(c_458,plain,
    multiply(inverse(A),inverse(A)) = add(inverse(A),inverse(A)),
    inference(paramod,[status(thm)],[c_73,c_457]) ).

cnf(c_269,plain,
    add(inverse(A),inverse(A)) = multiply(inverse(A),inverse(A)),
    inference(copy,[status(thm)],[c_458]) ).

cnf(c_459,plain,
    add(multiply(inverse(A),n1),multiply(B,multiply(inverse(A),inverse(A)))) = multiply(add(inverse(A),inverse(A)),add(inverse(A),B)),
    inference(paramod,[status(thm)],[c_269,c_250]) ).

cnf(c_280,plain,
    add(multiply(inverse(A),n1),multiply(B,multiply(inverse(A),inverse(A)))) = multiply(multiply(inverse(A),inverse(A)),add(inverse(A),B)),
    inference(paramod,[status(thm)],[c_269,c_459]) ).

cnf(c_460,plain,
    add(multiply(inverse(A),inverse(A)),multiply(inverse(A),inverse(A))) = inverse(A),
    inference(paramod,[status(thm)],[c_269,c_249]) ).

cnf(c_461,plain,
    multiply(inverse(A),add(inverse(A),inverse(A))) = inverse(A),
    inference(paramod,[status(thm)],[c_3,c_460]) ).

cnf(c_281,plain,
    multiply(inverse(A),multiply(inverse(A),inverse(A))) = inverse(A),
    inference(paramod,[status(thm)],[c_269,c_461]) ).

cnf(c_462,plain,
    multiply(inverse(A),multiply(inverse(A),inverse(A))) = multiply(inverse(A),n1),
    inference(paramod,[status(thm)],[c_269,c_242]) ).

cnf(c_463,plain,
    inverse(A) = multiply(inverse(A),n1),
    inference(paramod,[status(thm)],[c_281,c_462]) ).

cnf(c_284,plain,
    multiply(inverse(A),n1) = inverse(A),
    inference(copy,[status(thm)],[c_463]) ).

cnf(c_285,plain,
    add(inverse(n1),multiply(inverse(A),inverse(A))) = inverse(A),
    inference(paramod,[status(thm)],[c_269,c_241]) ).

cnf(c_288,plain,
    add(multiply(A,n1),multiply(inverse(B),inverse(B))) = multiply(n1,add(A,inverse(B))),
    inference(paramod,[status(thm)],[c_269,c_224]) ).

cnf(c_464,plain,
    inverse(A) = add(inverse(A),inverse(A)),
    inference(paramod,[status(thm)],[c_284,c_212]) ).

cnf(c_465,plain,
    inverse(A) = multiply(inverse(A),inverse(A)),
    inference(paramod,[status(thm)],[c_269,c_464]) ).

cnf(c_293,plain,
    multiply(inverse(A),inverse(A)) = inverse(A),
    inference(copy,[status(thm)],[c_465]) ).

cnf(c_466,plain,
    add(inverse(A),multiply(B,multiply(inverse(A),inverse(A)))) = multiply(multiply(inverse(A),inverse(A)),add(inverse(A),B)),
    inference(paramod,[status(thm)],[c_284,c_280]) ).

cnf(c_467,plain,
    add(inverse(A),multiply(B,inverse(A))) = multiply(multiply(inverse(A),inverse(A)),add(inverse(A),B)),
    inference(paramod,[status(thm)],[c_293,c_466]) ).

cnf(c_300,plain,
    add(inverse(A),multiply(B,inverse(A))) = multiply(inverse(A),add(inverse(A),B)),
    inference(paramod,[status(thm)],[c_293,c_467]) ).

cnf(c_311,plain,
    add(multiply(A,n1),inverse(B)) = multiply(n1,add(A,inverse(B))),
    inference(paramod,[status(thm)],[c_293,c_288]) ).

cnf(c_314,plain,
    add(inverse(n1),inverse(A)) = inverse(A),
    inference(paramod,[status(thm)],[c_293,c_285]) ).

cnf(c_316,plain,
    add(inverse(A),inverse(A)) = inverse(A),
    inference(paramod,[status(thm)],[c_293,c_269]) ).

cnf(c_331,plain,
    inverse(inverse(n1)) = n1,
    inference(paramod,[status(thm)],[c_314,c_4]) ).

cnf(c_468,plain,
    add(multiply(inverse(n1),inverse(A)),multiply(inverse(n1),inverse(A))) = inverse(n1),
    inference(paramod,[status(thm)],[c_314,c_12]) ).

cnf(c_469,plain,
    multiply(inverse(A),add(inverse(n1),inverse(n1))) = inverse(n1),
    inference(paramod,[status(thm)],[c_3,c_468]) ).

cnf(c_333,plain,
    multiply(inverse(A),inverse(n1)) = inverse(n1),
    inference(paramod,[status(thm)],[c_316,c_469]) ).

cnf(c_470,plain,
    multiply(inverse(n1),multiply(A,inverse(A))) = multiply(A,add(inverse(n1),inverse(A))),
    inference(paramod,[status(thm)],[c_314,c_21]) ).

cnf(c_334,plain,
    multiply(inverse(n1),multiply(A,inverse(A))) = multiply(A,inverse(A)),
    inference(paramod,[status(thm)],[c_314,c_470]) ).

cnf(c_471,plain,
    add(inverse(n1),multiply(A,inverse(n1))) = multiply(inverse(n1),add(inverse(B),A)),
    inference(paramod,[status(thm)],[c_333,c_3]) ).

cnf(c_336,plain,
    multiply(inverse(n1),add(inverse(n1),A)) = multiply(inverse(n1),add(inverse(B),A)),
    inference(paramod,[status(thm)],[c_300,c_471]) ).

cnf(c_472,plain,
    add(multiply(A,n1),multiply(inverse(n1),add(A,inverse(inverse(n1))))) = A,
    inference(paramod,[status(thm)],[c_331,c_10]) ).

cnf(c_473,plain,
    add(multiply(A,n1),multiply(inverse(n1),add(A,n1))) = A,
    inference(paramod,[status(thm)],[c_331,c_472]) ).

cnf(c_474,plain,
    add(multiply(A,n1),multiply(inverse(n1),n1)) = A,
    inference(paramod,[status(thm)],[c_199,c_473]) ).

cnf(c_475,plain,
    add(multiply(A,n1),inverse(n1)) = A,
    inference(paramod,[status(thm)],[c_284,c_474]) ).

cnf(c_339,plain,
    multiply(n1,add(A,inverse(n1))) = A,
    inference(paramod,[status(thm)],[c_311,c_475]) ).

cnf(c_476,plain,
    multiply(A,multiply(inverse(n1),add(A,n1))) = multiply(inverse(n1),add(A,inverse(inverse(n1)))),
    inference(paramod,[status(thm)],[c_331,c_21]) ).

cnf(c_477,plain,
    multiply(A,multiply(inverse(n1),n1)) = multiply(inverse(n1),add(A,inverse(inverse(n1)))),
    inference(paramod,[status(thm)],[c_199,c_476]) ).

cnf(c_478,plain,
    multiply(A,inverse(n1)) = multiply(inverse(n1),add(A,inverse(inverse(n1)))),
    inference(paramod,[status(thm)],[c_284,c_477]) ).

cnf(c_479,plain,
    multiply(A,inverse(n1)) = multiply(inverse(n1),add(A,n1)),
    inference(paramod,[status(thm)],[c_331,c_478]) ).

cnf(c_480,plain,
    multiply(A,inverse(n1)) = multiply(inverse(n1),n1),
    inference(paramod,[status(thm)],[c_199,c_479]) ).

cnf(c_341,plain,
    multiply(A,inverse(n1)) = inverse(n1),
    inference(paramod,[status(thm)],[c_284,c_480]) ).

cnf(c_481,plain,
    add(inverse(n1),multiply(A,inverse(n1))) = multiply(inverse(n1),add(B,A)),
    inference(paramod,[status(thm)],[c_341,c_3]) ).

cnf(c_482,plain,
    add(inverse(n1),inverse(n1)) = multiply(inverse(n1),add(B,A)),
    inference(paramod,[status(thm)],[c_341,c_481]) ).

cnf(c_483,plain,
    inverse(n1) = multiply(inverse(n1),add(B,A)),
    inference(paramod,[status(thm)],[c_316,c_482]) ).

cnf(c_414,plain,
    multiply(inverse(n1),add(A,B)) = inverse(n1),
    inference(copy,[status(thm)],[c_483]) ).

cnf(c_484,plain,
    add(inverse(n1),multiply(n1,add(A,inverse(n1)))) = A,
    inference(paramod,[status(thm)],[c_341,c_10]) ).

cnf(c_415,plain,
    add(inverse(n1),A) = A,
    inference(paramod,[status(thm)],[c_339,c_484]) ).

cnf(c_485,plain,
    multiply(inverse(n1),A) = multiply(inverse(n1),add(inverse(B),A)),
    inference(paramod,[status(thm)],[c_415,c_336]) ).

cnf(c_418,plain,
    multiply(inverse(n1),A) = inverse(n1),
    inference(paramod,[status(thm)],[c_414,c_485]) ).

cnf(c_486,plain,
    inverse(n1) = multiply(A,inverse(A)),
    inference(paramod,[status(thm)],[c_418,c_334]) ).

cnf(c_421,plain,
    multiply(A,inverse(A)) = inverse(n1),
    inference(copy,[status(thm)],[c_486]) ).

cnf(c_487,plain,
    inverse(n1) != multiply(a,inverse(a)),
    inference(paramod,[status(thm)],[c_421,c_13]) ).

cnf(c_488,plain,
    inverse(n1) != inverse(n1),
    inference(paramod,[status(thm)],[c_421,c_487]) ).

cnf(c_432,plain,
    $false,
    inference(copy,[status(thm)],[c_488]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : BOO025-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/10.42  % Computer : n010.cluster.edu
% 0.09/10.42  % Model    : x86_64 x86_64
% 0.09/10.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.42  % Memory   : 8046.5625MB
% 0.09/10.42  % OS       : Linux 6.8.0-71-generic
% 0.09/10.42  % CPULimit : 300
% 0.09/10.42  % WCLimit  : 300
% 0.09/10.42  % DateTime : Sat Sep 26 22:37:56 UTC 2026
% 0.09/10.42  % CPUTime  : 
% 0.09/10.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/10.43  % Process 198867 was started by sandbox on n010,
% 0.09/10.43  % Sat Sep 26 22:37:56 2026
% 0.09/10.43  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/10.43  
% 0.09/10.43  % From the command line: assign(max_seconds, 300).
% 0.13/10.53  
% 0.13/10.53  % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.13/10.53  
% 0.13/10.53  % SZS status Unsatisfiable for theBenchmark
% 0.13/10.53  
% 0.13/10.53  % Proof 1 at 0.07 (+ 0.02) seconds.
% 0.13/10.53  % Length of proof is 70.
% 0.13/10.53  % Level of proof is 25.
% 0.13/10.53  % Maximum clause weight is 58.000.
% 0.13/10.53  % Given clauses 60.
% 0.13/10.53  
% 0.13/10.53  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------