↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GRP116-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/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 07:27:22 AM UTC 2026

% Result   : Unsatisfiable 0.17s 5.47s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   38 (  38 unt;   0 def)
%            Number of atoms       :   38 (  37 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   82 (   0 sgn   3   !;   0   ?)

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

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

fof(prove_order3,axiom,
    multiply(identity,a) != a,
    file('theBenchmark.p',prove_order3) ).

cnf(c_2,plain,
    multiply(identity,a) != a,
    inference(clausify,[status(thm)],[prove_order3]) ).

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

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

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

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

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

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

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

cnf(c_62,plain,
    multiply(A,multiply(A,multiply(multiply(A,B),multiply(identity,identity)))) = B,
    inference(paramod,[status(thm)],[c_8,c_4]) ).

cnf(c_17,plain,
    multiply(A,multiply(A,multiply(A,multiply(B,identity)))) = B,
    inference(paramod,[status(thm)],[c_8,c_62]) ).

cnf(c_27,plain,
    multiply(A,multiply(multiply(B,C),multiply(C,C))) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_17,c_5]) ).

cnf(c_29,plain,
    multiply(multiply(A,B),C) = multiply(A,multiply(B,multiply(identity,multiply(identity,multiply(C,identity))))),
    inference(paramod,[status(thm)],[c_17,c_8]) ).

cnf(c_63,plain,
    multiply(A,multiply(multiply(B,multiply(identity,C)),multiply(identity,multiply(C,C)))) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_8,c_27]) ).

cnf(c_64,plain,
    multiply(A,multiply(B,multiply(multiply(identity,C),multiply(C,C)))) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_8,c_63]) ).

cnf(c_37,plain,
    multiply(A,multiply(B,multiply(identity,identity))) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_27,c_64]) ).

cnf(c_42,plain,
    multiply(A,multiply(A,multiply(A,identity))) = identity,
    inference(paramod,[status(thm)],[c_37,c_17]) ).

cnf(c_65,plain,
    multiply(identity,multiply(identity,A)) = multiply(B,multiply(multiply(B,multiply(B,identity)),A)),
    inference(paramod,[status(thm)],[c_42,c_8]) ).

cnf(c_43,plain,
    multiply(A,multiply(multiply(A,multiply(A,identity)),B)) = multiply(identity,multiply(identity,B)),
    inference(copy,[status(thm)],[c_65]) ).

cnf(c_45,plain,
    multiply(A,identity) = A,
    inference(paramod,[status(thm)],[c_42,c_17]) ).

cnf(c_66,plain,
    multiply(A,multiply(identity,multiply(multiply(B,multiply(B,identity)),multiply(B,multiply(B,identity))))) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_42,c_27]) ).

cnf(c_67,plain,
    multiply(A,multiply(identity,multiply(multiply(B,B),multiply(B,multiply(B,identity))))) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_45,c_66]) ).

cnf(c_68,plain,
    multiply(A,multiply(identity,multiply(multiply(B,B),multiply(B,B)))) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_45,c_67]) ).

cnf(c_69,plain,
    multiply(A,multiply(identity,multiply(B,identity))) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_27,c_68]) ).

cnf(c_70,plain,
    multiply(A,multiply(identity,B)) = multiply(A,multiply(B,identity)),
    inference(paramod,[status(thm)],[c_45,c_69]) ).

cnf(c_46,plain,
    multiply(A,multiply(identity,B)) = multiply(A,B),
    inference(paramod,[status(thm)],[c_45,c_70]) ).

cnf(c_71,plain,
    multiply(A,multiply(multiply(A,A),B)) = multiply(identity,multiply(identity,B)),
    inference(paramod,[status(thm)],[c_45,c_43]) ).

cnf(c_47,plain,
    multiply(A,multiply(multiply(A,A),B)) = multiply(identity,B),
    inference(paramod,[status(thm)],[c_46,c_71]) ).

cnf(c_72,plain,
    multiply(multiply(A,B),C) = multiply(A,multiply(B,multiply(identity,multiply(identity,C)))),
    inference(paramod,[status(thm)],[c_45,c_29]) ).

cnf(c_73,plain,
    multiply(multiply(A,B),C) = multiply(A,multiply(B,multiply(identity,C))),
    inference(paramod,[status(thm)],[c_46,c_72]) ).

cnf(c_53,plain,
    multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
    inference(paramod,[status(thm)],[c_46,c_73]) ).

cnf(c_55,plain,
    multiply(A,multiply(A,multiply(A,B))) = B,
    inference(paramod,[status(thm)],[c_45,c_17]) ).

cnf(c_74,plain,
    multiply(A,multiply(A,multiply(A,B))) = multiply(identity,B),
    inference(paramod,[status(thm)],[c_53,c_47]) ).

cnf(c_75,plain,
    B = multiply(identity,B),
    inference(paramod,[status(thm)],[c_55,c_74]) ).

cnf(c_57,plain,
    multiply(identity,A) = A,
    inference(copy,[status(thm)],[c_75]) ).

cnf(c_58,plain,
    $false,
    inference(resolve,[status(thm)],[c_57,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP116-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.43  % Computer : n010.cluster.edu
% 0.17/5.43  % Model    : x86_64 x86_64
% 0.17/5.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.43  % Memory   : 8046.5625MB
% 0.17/5.43  % OS       : Linux 6.8.0-71-generic
% 0.17/5.43  % CPULimit : 300
% 0.17/5.43  % WCLimit  : 300
% 0.17/5.43  % DateTime : Fri Sep 25 14:23:50 UTC 2026
% 0.17/5.44  % CPUTime  : 
% 0.17/5.44  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/5.44  % Process 952211 was started by sandbox2 on n010,
% 0.17/5.44  % Fri Sep 25 14:23:50 2026
% 0.17/5.44  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/5.44  
% 0.17/5.44  % From the command line: assign(max_seconds, 300).
% 0.17/5.47  
% 0.17/5.47  % SZS status Unsatisfiable for theBenchmark
% 0.17/5.47  
% 0.17/5.47  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.17/5.47  % Length of proof is 19.
% 0.17/5.47  % Level of proof is 11.
% 0.17/5.47  % Maximum clause weight is 98.000.
% 0.17/5.47  % Given clauses 10.
% 0.17/5.47  
% 0.17/5.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------