↑ Up

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

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

% Computer : n002.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:11:32 AM UTC 2026

% Result   : Unsatisfiable 1.96s 0.70s
% Output   : CNFRefutation 2.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   28 (  14 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   47 (  24   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   28 (   0 sgn  12   !;   0   ?)

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

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

fof(existence_of_identity_multiplication,axiom,
    ! [VAR_0] :
      ( ~ defined(VAR_0)
      | product(multiplicative_identity,VAR_0,VAR_0) ),
    file('theBenchmark.p',existence_of_identity_multiplication) ).

cnf(c_8,plain,
    ( ~ defined(A)
    | product(multiplicative_identity,A,A) ),
    inference(clausify,[status(thm)],[existence_of_identity_multiplication]) ).

fof(existence_of_inverse_multiplication,axiom,
    ! [VAR_0] :
      ( ~ defined(VAR_0)
      | sum(additive_identity,VAR_0,additive_identity)
      | product(multiplicative_inverse(VAR_0),VAR_0,multiplicative_identity) ),
    file('theBenchmark.p',existence_of_inverse_multiplication) ).

cnf(c_9,plain,
    ( ~ defined(A)
    | sum(additive_identity,A,additive_identity)
    | product(multiplicative_inverse(A),A,multiplicative_identity) ),
    inference(clausify,[status(thm)],[existence_of_inverse_multiplication]) ).

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

cnf(c_10,plain,
    ( ~ product(B,A,C)
    | product(A,B,C) ),
    inference(clausify,[status(thm)],[commutativity_multiplication]) ).

fof(well_definedness_of_multiplicative_inverse,axiom,
    ! [VAR_0] :
      ( sum(additive_identity,VAR_0,additive_identity)
      | ~ defined(VAR_0)
      | defined(multiplicative_inverse(VAR_0)) ),
    file('theBenchmark.p',well_definedness_of_multiplicative_inverse) ).

cnf(c_18,plain,
    ( sum(additive_identity,A,additive_identity)
    | ~ defined(A)
    | defined(multiplicative_inverse(A)) ),
    inference(clausify,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).

fof(a_is_defined,axiom,
    defined(a),
    file('theBenchmark.p',a_is_defined) ).

cnf(c_27,plain,
    defined(a),
    inference(clausify,[status(thm)],[a_is_defined]) ).

fof(product_2,axiom,
    product(multiplicative_identity,a,multiplicative_identity),
    file('theBenchmark.p',product_2) ).

cnf(c_28,plain,
    product(multiplicative_identity,a,multiplicative_identity),
    inference(clausify,[status(thm)],[product_2]) ).

fof(not_sum_3,axiom,
    ~ sum(additive_identity,a,additive_identity),
    file('theBenchmark.p',not_sum_3) ).

cnf(c_29,plain,
    ~ sum(additive_identity,a,additive_identity),
    inference(clausify,[status(thm)],[not_sum_3]) ).

fof(not_product_4,axiom,
    ~ product(multiplicative_identity,multiplicative_identity,multiplicative_inverse(a)),
    file('theBenchmark.p',not_product_4) ).

cnf(c_30,plain,
    ~ product(multiplicative_identity,multiplicative_identity,multiplicative_inverse(a)),
    inference(clausify,[status(thm)],[not_product_4]) ).

cnf(c_1770,plain,
    ( sum(additive_identity,a,additive_identity)
    | defined(multiplicative_inverse(a)) ),
    inference(resolve,[status(thm)],[c_27,c_18]) ).

cnf(c_90,plain,
    defined(multiplicative_inverse(a)),
    inference(resolve,[status(thm)],[c_29,c_1770]) ).

cnf(c_1771,plain,
    ( sum(additive_identity,a,additive_identity)
    | product(multiplicative_inverse(a),a,multiplicative_identity) ),
    inference(resolve,[status(thm)],[c_27,c_9]) ).

cnf(c_96,plain,
    product(multiplicative_inverse(a),a,multiplicative_identity),
    inference(resolve,[status(thm)],[c_29,c_1771]) ).

cnf(c_513,plain,
    product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(a)),
    inference(resolve,[status(thm)],[c_90,c_8]) ).

cnf(c_1319,plain,
    product(a,multiplicative_inverse(a),multiplicative_identity),
    inference(resolve,[status(thm)],[c_96,c_10]) ).

cnf(c_1772,plain,
    ( ~ product(B,C,multiplicative_inverse(a))
    | ~ product(A,C,multiplicative_identity)
    | ~ product(multiplicative_identity,A,B) ),
    inference(resolve,[status(thm)],[c_6,c_30]) ).

cnf(c_1773,plain,
    ( ~ product(multiplicative_identity,A,multiplicative_inverse(a))
    | ~ product(a,A,multiplicative_identity) ),
    inference(resolve,[status(thm)],[c_1772,c_28]) ).

cnf(c_1774,plain,
    ~ product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(a)),
    inference(resolve,[status(thm)],[c_1773,c_1319]) ).

cnf(c_1769,plain,
    $false,
    inference(resolve,[status(thm)],[c_513,c_1774]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD031-5 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 27 02:27:50 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 3127655 was started by sandbox on n002,
% 0.09/0.37  % Sun Sep 27 02:27:50 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38  
% 0.09/0.38  % From the command line: assign(max_seconds, 300).
% 1.96/0.70  
% 1.96/0.70  % SZS status Unsatisfiable for theBenchmark
% 1.96/0.70  
% 1.96/0.70  % Proof 1 at 0.17 (+ 0.06) seconds.
% 1.96/0.70  % Length of proof is 14.
% 1.96/0.70  % Level of proof is 3.
% 1.96/0.70  % Maximum clause weight is 18.000.
% 1.96/0.70  % Given clauses 189.
% 1.96/0.70  
% 1.96/0.70  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------