↑ Up

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

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

% Computer : n026.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:26:19 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.36s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   39 (  21   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   44 (   2 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_a_has_a_left_inverse,axiom,
    ! [VAR_0] : ~ product(VAR_0,a,identity),
    file('theBenchmark.p',prove_a_has_a_left_inverse) ).

cnf(c_1,plain,
    ~ product(A,a,identity),
    inference(clausify,[status(thm)],[prove_a_has_a_left_inverse]) ).

fof(right_identity,axiom,
    ! [VAR_0] : product(VAR_0,identity,VAR_0),
    file('theBenchmark.p',right_identity) ).

cnf(c_2,plain,
    product(A,identity,A),
    inference(clausify,[status(thm)],[right_identity]) ).

fof(right_inverse,axiom,
    ! [VAR_0] : product(VAR_0,inverse(VAR_0),identity),
    file('theBenchmark.p',right_inverse) ).

cnf(c_3,plain,
    product(A,inverse(A),identity),
    inference(clausify,[status(thm)],[right_inverse]) ).

fof(associativity2,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
      ( product(VAR_2,VAR_3,VAR_5)
      | ~ product(VAR_0,VAR_4,VAR_5)
      | ~ product(VAR_1,VAR_3,VAR_4)
      | ~ product(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',associativity2) ).

cnf(c_4,plain,
    ( product(C,D,F)
    | ~ product(A,E,F)
    | ~ product(B,D,E)
    | ~ product(A,B,C) ),
    inference(clausify,[status(thm)],[associativity2]) ).

fof(associativity1,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
      ( product(VAR_0,VAR_4,VAR_5)
      | ~ product(VAR_2,VAR_3,VAR_5)
      | ~ product(VAR_1,VAR_3,VAR_4)
      | ~ product(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',associativity1) ).

cnf(c_5,plain,
    ( product(A,E,F)
    | ~ product(C,D,F)
    | ~ product(B,D,E)
    | ~ product(A,B,C) ),
    inference(clausify,[status(thm)],[associativity1]) ).

cnf(c_17,plain,
    ( product(identity,B,D)
    | ~ product(A,C,D)
    | ~ product(inverse(A),B,C) ),
    inference(resolve,[status(thm)],[c_4,c_3]) ).

cnf(c_18,plain,
    ( product(identity,inverse(inverse(A)),B)
    | ~ product(A,identity,B) ),
    inference(resolve,[status(thm)],[c_17,c_3]) ).

cnf(c_8,plain,
    product(identity,inverse(inverse(A)),A),
    inference(resolve,[status(thm)],[c_18,c_2]) ).

cnf(c_19,plain,
    ( product(C,B,D)
    | ~ product(C,A,D)
    | ~ product(identity,A,B) ),
    inference(resolve,[status(thm)],[c_5,c_2]) ).

cnf(c_20,plain,
    ( product(A,B,identity)
    | ~ product(identity,inverse(A),B) ),
    inference(resolve,[status(thm)],[c_19,c_3]) ).

cnf(c_15,plain,
    ~ product(identity,inverse(A),a),
    inference(resolve,[status(thm)],[c_20,c_1]) ).

cnf(c_16,plain,
    $false,
    inference(resolve,[status(thm)],[c_15,c_8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP031-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34  % Computer : n026.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Fri Sep 25 14:21:09 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35  % Process 2715461 was started by sandbox on n026,
% 0.09/0.35  % Fri Sep 25 14:21:09 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.35  
% 0.09/0.35  % From the command line: assign(max_seconds, 300).
% 0.12/0.36  
% 0.12/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.36  
% 0.12/0.36  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.36  % Length of proof is 8.
% 0.12/0.36  % Level of proof is 2.
% 0.12/0.36  % Maximum clause weight is 16.000.
% 0.12/0.36  % Given clauses 5.
% 0.12/0.36  
% 0.12/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------