↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GRP511-1 : TPTP v9.3.1. Released v2.6.0.
% 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:30:15 AM UTC 2026

% Result   : Unsatisfiable 0.16s 5.46s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   66 (  66 unt;   0 def)
%            Number of atoms       :   66 (  65 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   1 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  189 (   0 sgn   3   !;   0   ?)

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

cnf(c_1,plain,
    multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B,
    inference(clausify,[status(thm)],[single_axiom]) ).

fof(prove_these_axioms_3,axiom,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('theBenchmark.p',prove_these_axioms_3) ).

cnf(c_2,plain,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(clausify,[status(thm)],[prove_these_axioms_3]) ).

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

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

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

cnf(c_16,plain,
    multiply(A,inverse(multiply(B,inverse(multiply(multiply(C,multiply(B,D)),inverse(multiply(C,A))))))) = D,
    inference(paramod,[status(thm)],[c_4,c_1]) ).

cnf(c_224,plain,
    multiply(multiply(inverse(multiply(multiply(A,B),inverse(multiply(A,C)))),D),inverse(multiply(multiply(C,E),D))) = inverse(multiply(B,E)),
    inference(paramod,[status(thm)],[c_4,c_3]) ).

cnf(c_20,plain,
    inverse(multiply(A,B)) = multiply(multiply(inverse(multiply(multiply(C,A),inverse(multiply(C,D)))),E),inverse(multiply(multiply(D,B),E))),
    inference(copy,[status(thm)],[c_224]) ).

cnf(c_225,plain,
    multiply(multiply(A,B),inverse(multiply(C,B))) = inverse(multiply(D,inverse(multiply(multiply(E,multiply(D,A)),inverse(multiply(E,C)))))),
    inference(paramod,[status(thm)],[c_4,c_3]) ).

cnf(c_21,plain,
    inverse(multiply(A,inverse(multiply(multiply(B,multiply(A,C)),inverse(multiply(B,D)))))) = multiply(multiply(C,E),inverse(multiply(D,E))),
    inference(copy,[status(thm)],[c_225]) ).

cnf(c_226,plain,
    A = inverse(multiply(B,multiply(C,inverse(multiply(multiply(B,C),A))))),
    inference(paramod,[status(thm)],[c_4,c_3]) ).

cnf(c_23,plain,
    inverse(multiply(A,multiply(B,inverse(multiply(multiply(A,B),C))))) = C,
    inference(copy,[status(thm)],[c_226]) ).

cnf(c_227,plain,
    multiply(A,inverse(multiply(multiply(B,A),inverse(C)))) = inverse(multiply(multiply(D,B),inverse(multiply(D,C)))),
    inference(paramod,[status(thm)],[c_4,c_4]) ).

cnf(c_27,plain,
    inverse(multiply(multiply(A,B),inverse(multiply(A,C)))) = multiply(D,inverse(multiply(multiply(B,D),inverse(C)))),
    inference(copy,[status(thm)],[c_227]) ).

cnf(c_28,plain,
    multiply(multiply(multiply(A,B),multiply(C,inverse(multiply(multiply(A,C),D)))),D) = B,
    inference(paramod,[status(thm)],[c_23,c_1]) ).

cnf(c_34,plain,
    inverse(multiply(multiply(A,B),inverse(multiply(A,multiply(B,C))))) = C,
    inference(paramod,[status(thm)],[c_3,c_23]) ).

cnf(c_228,plain,
    inverse(multiply(A,multiply(B,inverse(C)))) = inverse(multiply(multiply(D,multiply(A,B)),inverse(multiply(D,C)))),
    inference(paramod,[status(thm)],[c_4,c_23]) ).

cnf(c_37,plain,
    inverse(multiply(multiply(A,multiply(B,C)),inverse(multiply(A,D)))) = inverse(multiply(B,multiply(C,inverse(D)))),
    inference(copy,[status(thm)],[c_228]) ).

cnf(c_40,plain,
    inverse(multiply(A,inverse(multiply(A,multiply(B,inverse(C)))))) = multiply(multiply(B,D),inverse(multiply(C,D))),
    inference(paramod,[status(thm)],[c_37,c_21]) ).

cnf(c_41,plain,
    multiply(A,inverse(multiply(B,inverse(multiply(B,multiply(C,inverse(A))))))) = C,
    inference(paramod,[status(thm)],[c_37,c_16]) ).

cnf(c_46,plain,
    inverse(multiply(A,inverse(multiply(B,multiply(inverse(multiply(multiply(C,B),inverse(multiply(C,A)))),D))))) = D,
    inference(paramod,[status(thm)],[c_4,c_34]) ).

cnf(c_52,plain,
    multiply(A,inverse(multiply(multiply(B,A),C))) = inverse(multiply(B,C)),
    inference(paramod,[status(thm)],[c_1,c_11]) ).

cnf(c_229,plain,
    multiply(A,inverse(B)) = inverse(multiply(multiply(C,B),inverse(multiply(C,A)))),
    inference(paramod,[status(thm)],[c_4,c_11]) ).

cnf(c_62,plain,
    inverse(multiply(multiply(A,B),inverse(multiply(A,C)))) = multiply(C,inverse(B)),
    inference(copy,[status(thm)],[c_229]) ).

cnf(c_75,plain,
    multiply(multiply(multiply(A,B),inverse(multiply(A,C))),C) = B,
    inference(paramod,[status(thm)],[c_52,c_28]) ).

cnf(c_230,plain,
    multiply(C,inverse(B)) = multiply(D,inverse(multiply(multiply(B,D),inverse(C)))),
    inference(paramod,[status(thm)],[c_62,c_27]) ).

cnf(c_231,plain,
    multiply(C,inverse(B)) = inverse(multiply(B,inverse(C))),
    inference(paramod,[status(thm)],[c_52,c_230]) ).

cnf(c_76,plain,
    inverse(multiply(A,inverse(B))) = multiply(B,inverse(A)),
    inference(copy,[status(thm)],[c_231]) ).

cnf(c_232,plain,
    inverse(multiply(A,inverse(multiply(A,C)))) = C,
    inference(paramod,[status(thm)],[c_52,c_23]) ).

cnf(c_77,plain,
    multiply(multiply(A,B),inverse(A)) = B,
    inference(paramod,[status(thm)],[c_76,c_232]) ).

cnf(c_233,plain,
    inverse(multiply(A,inverse(multiply(B,multiply(multiply(multiply(C,A),inverse(multiply(C,B))),D))))) = D,
    inference(paramod,[status(thm)],[c_76,c_46]) ).

cnf(c_95,plain,
    multiply(multiply(A,multiply(multiply(multiply(B,C),inverse(multiply(B,A))),D)),inverse(C)) = D,
    inference(paramod,[status(thm)],[c_76,c_233]) ).

cnf(c_100,plain,
    inverse(multiply(A,B)) = multiply(multiply(multiply(multiply(C,D),inverse(multiply(C,A))),E),inverse(multiply(multiply(D,B),E))),
    inference(paramod,[status(thm)],[c_76,c_20]) ).

cnf(c_234,plain,
    multiply(A,multiply(multiply(B,multiply(C,inverse(A))),inverse(B))) = C,
    inference(paramod,[status(thm)],[c_76,c_41]) ).

cnf(c_103,plain,
    multiply(A,multiply(B,inverse(A))) = B,
    inference(paramod,[status(thm)],[c_77,c_234]) ).

cnf(c_235,plain,
    multiply(multiply(A,multiply(B,inverse(C))),inverse(A)) = multiply(multiply(B,D),inverse(multiply(C,D))),
    inference(paramod,[status(thm)],[c_76,c_40]) ).

cnf(c_236,plain,
    multiply(B,inverse(C)) = multiply(multiply(B,D),inverse(multiply(C,D))),
    inference(paramod,[status(thm)],[c_77,c_235]) ).

cnf(c_104,plain,
    multiply(multiply(A,B),inverse(multiply(C,B))) = multiply(A,inverse(C)),
    inference(copy,[status(thm)],[c_236]) ).

cnf(c_105,plain,
    multiply(multiply(A,B),inverse(multiply(A,C))) = multiply(B,inverse(C)),
    inference(paramod,[status(thm)],[c_76,c_62]) ).

cnf(c_237,plain,
    inverse(multiply(A,B)) = multiply(multiply(multiply(D,inverse(A)),E),inverse(multiply(multiply(D,B),E))),
    inference(paramod,[status(thm)],[c_105,c_100]) ).

cnf(c_238,plain,
    inverse(multiply(A,B)) = multiply(multiply(D,inverse(A)),inverse(multiply(D,B))),
    inference(paramod,[status(thm)],[c_104,c_237]) ).

cnf(c_109,plain,
    inverse(multiply(A,B)) = multiply(inverse(A),inverse(B)),
    inference(paramod,[status(thm)],[c_105,c_238]) ).

cnf(c_119,plain,
    multiply(multiply(A,multiply(multiply(multiply(B,C),multiply(inverse(B),inverse(A))),D)),inverse(C)) = D,
    inference(paramod,[status(thm)],[c_109,c_95]) ).

cnf(c_123,plain,
    multiply(multiply(multiply(A,B),multiply(inverse(A),inverse(C))),C) = B,
    inference(paramod,[status(thm)],[c_109,c_75]) ).

cnf(c_127,plain,
    multiply(multiply(A,B),multiply(inverse(A),inverse(C))) = multiply(B,inverse(C)),
    inference(paramod,[status(thm)],[c_109,c_105]) ).

cnf(c_151,plain,
    multiply(multiply(A,inverse(B)),B) = A,
    inference(paramod,[status(thm)],[c_127,c_123]) ).

cnf(c_152,plain,
    multiply(multiply(A,multiply(multiply(B,inverse(A)),C)),inverse(B)) = C,
    inference(paramod,[status(thm)],[c_127,c_119]) ).

cnf(c_239,plain,
    multiply(A,inverse(multiply(A,inverse(B)))) = B,
    inference(paramod,[status(thm)],[c_151,c_77]) ).

cnf(c_157,plain,
    multiply(A,multiply(inverse(A),inverse(inverse(B)))) = B,
    inference(paramod,[status(thm)],[c_109,c_239]) ).

cnf(c_240,plain,
    A = inverse(inverse(A)),
    inference(paramod,[status(thm)],[c_151,c_77]) ).

cnf(c_158,plain,
    inverse(inverse(A)) = A,
    inference(copy,[status(thm)],[c_240]) ).

cnf(c_159,plain,
    multiply(A,B) = multiply(B,A),
    inference(paramod,[status(thm)],[c_77,c_151]) ).

cnf(c_160,plain,
    multiply(A,multiply(inverse(A),B)) = B,
    inference(paramod,[status(thm)],[c_158,c_157]) ).

cnf(c_179,plain,
    multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
    inference(paramod,[status(thm)],[c_159,c_2]) ).

cnf(c_241,plain,
    multiply(A,B) = multiply(C,multiply(multiply(A,inverse(C)),B)),
    inference(paramod,[status(thm)],[c_152,c_103]) ).

cnf(c_193,plain,
    multiply(A,multiply(multiply(B,inverse(A)),C)) = multiply(B,C),
    inference(copy,[status(thm)],[c_241]) ).

cnf(c_242,plain,
    multiply(A,multiply(B,C)) = multiply(multiply(A,B),C),
    inference(paramod,[status(thm)],[c_77,c_193]) ).

cnf(c_202,plain,
    multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
    inference(copy,[status(thm)],[c_242]) ).

cnf(c_243,plain,
    multiply(A,multiply(B,C)) = multiply(multiply(B,inverse(inverse(A))),C),
    inference(paramod,[status(thm)],[c_193,c_160]) ).

cnf(c_244,plain,
    multiply(A,multiply(B,C)) = multiply(multiply(B,A),C),
    inference(paramod,[status(thm)],[c_158,c_243]) ).

cnf(c_209,plain,
    multiply(A,multiply(B,C)) = multiply(B,multiply(A,C)),
    inference(paramod,[status(thm)],[c_202,c_244]) ).

cnf(c_245,plain,
    multiply(a3,multiply(c3,b3)) != multiply(a3,multiply(b3,c3)),
    inference(paramod,[status(thm)],[c_209,c_179]) ).

cnf(c_246,plain,
    multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
    inference(paramod,[status(thm)],[c_159,c_245]) ).

cnf(c_223,plain,
    $false,
    inference(copy,[status(thm)],[c_246]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP511-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/5.41  % Computer : n014.cluster.edu
% 0.16/5.41  % Model    : x86_64 x86_64
% 0.16/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.41  % Memory   : 8046.5625MB
% 0.16/5.41  % OS       : Linux 6.8.0-71-generic
% 0.16/5.41  % CPULimit : 300
% 0.16/5.41  % WCLimit  : 300
% 0.16/5.41  % DateTime : Fri Sep 25 14:57:37 UTC 2026
% 0.16/5.41  % CPUTime  : 
% 0.16/5.41  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/5.41  % Process 511681 was started by sandbox on n014,
% 0.16/5.41  % Fri Sep 25 14:57:37 2026
% 0.16/5.41  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/5.42  
% 0.16/5.42  % From the command line: assign(max_seconds, 300).
% 0.16/5.46  
% 0.16/5.46  % SZS status Unsatisfiable for theBenchmark
% 0.16/5.46  
% 0.16/5.46  % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.16/5.46  % Length of proof is 41.
% 0.16/5.46  % Level of proof is 13.
% 0.16/5.46  % Maximum clause weight is 23.000.
% 0.16/5.46  % Given clauses 23.
% 0.16/5.46  
% 0.16/5.46  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------