↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : FLD034-3 : 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 : n009.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:33 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.39s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   32 (  19   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   28 (   4 sgn  10   !;   0   ?)

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

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

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(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(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_3,axiom,
    product(multiplicative_identity,m,multiplicative_identity),
    file('theBenchmark.p',product_3) ).

cnf(c_29,plain,
    product(multiplicative_identity,m,multiplicative_identity),
    inference(clausify,[status(thm)],[product_3]) ).

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

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

cnf(c_37,plain,
    ( ~ product(D,B,D)
    | ~ product(C,D,A)
    | product(A,B,A) ),
    inference(factor,[status(thm)],[c_7]) ).

cnf(c_114,plain,
    product(multiplicative_identity,a,a),
    inference(resolve,[status(thm)],[c_27,c_8]) ).

cnf(c_205,plain,
    ~ product(a,m,a),
    inference(resolve,[status(thm)],[c_10,c_30]) ).

cnf(c_217,plain,
    ( ~ product(B,m,B)
    | ~ product(A,B,a) ),
    inference(resolve,[status(thm)],[c_37,c_205]) ).

cnf(c_214,plain,
    ~ product(A,multiplicative_identity,a),
    inference(resolve,[status(thm)],[c_217,c_29]) ).

cnf(c_215,plain,
    ~ product(multiplicative_identity,A,a),
    inference(resolve,[status(thm)],[c_10,c_214]) ).

cnf(c_216,plain,
    $false,
    inference(resolve,[status(thm)],[c_215,c_114]) ).

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