↑ Up

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

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

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

% Result   : Unsatisfiable 0.17s 0.45s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (  10 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   46 (  25   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 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   :   47 (   0 sgn  14   !;   0   ?)

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

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

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

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

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_3,plain,
    ( product(A,E,F)
    | ~ product(C,D,F)
    | ~ product(B,D,E)
    | ~ product(A,B,C) ),
    inference(clausify,[status(thm)],[associativity1]) ).

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(prove_there_is_a_right_identity,axiom,
    ~ product(a,identity,a),
    file('theBenchmark.p',prove_there_is_a_right_identity) ).

cnf(c_5,plain,
    ~ product(a,identity,a),
    inference(clausify,[status(thm)],[prove_there_is_a_right_identity]) ).

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

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

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

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

cnf(c_22,plain,
    ( product(A,identity,B)
    | ~ product(A,inverse(B),identity) ),
    inference(resolve,[status(thm)],[c_21,c_2]) ).

cnf(c_10,plain,
    ~ product(a,inverse(a),identity),
    inference(resolve,[status(thm)],[c_22,c_5]) ).

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

cnf(c_24,plain,
    ( product(B,A,identity)
    | ~ product(inverse(A),identity,B) ),
    inference(resolve,[status(thm)],[c_23,c_1]) ).

cnf(c_17,plain,
    ~ product(inverse(inverse(a)),identity,a),
    inference(resolve,[status(thm)],[c_24,c_10]) ).

cnf(c_18,plain,
    $false,
    inference(resolve,[status(thm)],[c_17,c_7]) ).

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