↑ Up

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

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

% Computer : n017.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:35 AM UTC 2026

% Result   : Unsatisfiable 2.55s 0.76s
% Output   : CNFRefutation 2.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   54 (  26 unt;   0 def)
%            Number of atoms       :  104 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :  108 (  58   ~;  50   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-1 aty)
%            Number of variables   :   87 (   9 sgn  29   !;   0   ?)

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

cnf(c_2,plain,
    ( ~ sum(D,F,C)
    | ~ sum(E,B,F)
    | ~ sum(D,E,A)
    | sum(A,B,C) ),
    inference(clausify,[status(thm)],[associativity_addition_2]) ).

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

cnf(c_3,plain,
    ( ~ defined(A)
    | sum(additive_identity,A,A) ),
    inference(clausify,[status(thm)],[existence_of_identity_addition]) ).

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

cnf(c_4,plain,
    ( ~ defined(A)
    | sum(additive_inverse(A),A,additive_identity) ),
    inference(clausify,[status(thm)],[existence_of_inverse_addition]) ).

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

cnf(c_5,plain,
    ( ~ sum(B,A,C)
    | sum(A,B,C) ),
    inference(clausify,[status(thm)],[commutativity_addition]) ).

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(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(distributivity_1,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6] :
      ( ~ product(VAR_4,VAR_6,VAR_1)
      | ~ product(VAR_3,VAR_6,VAR_0)
      | ~ product(VAR_5,VAR_6,VAR_2)
      | ~ sum(VAR_3,VAR_4,VAR_5)
      | sum(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',distributivity_1) ).

cnf(c_11,plain,
    ( ~ product(E,V6,B)
    | ~ product(D,V6,A)
    | ~ product(F,V6,C)
    | ~ sum(D,E,F)
    | sum(A,B,C) ),
    inference(clausify,[status(thm)],[distributivity_1]) ).

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(b_is_defined,axiom,
    defined(b),
    file('theBenchmark.p',b_is_defined) ).

cnf(c_28,plain,
    defined(b),
    inference(clausify,[status(thm)],[b_is_defined]) ).

fof(c_is_defined,axiom,
    defined(c),
    file('theBenchmark.p',c_is_defined) ).

cnf(c_29,plain,
    defined(c),
    inference(clausify,[status(thm)],[c_is_defined]) ).

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

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

fof(not_sum_5,axiom,
    ~ sum(additive_identity,b,additive_identity),
    file('theBenchmark.p',not_sum_5) ).

cnf(c_31,plain,
    ~ sum(additive_identity,b,additive_identity),
    inference(clausify,[status(thm)],[not_sum_5]) ).

fof(product_6,axiom,
    product(a,b,c),
    file('theBenchmark.p',product_6) ).

cnf(c_32,plain,
    product(a,b,c),
    inference(clausify,[status(thm)],[product_6]) ).

fof(sum_7,axiom,
    sum(additive_identity,c,additive_identity),
    file('theBenchmark.p',sum_7) ).

cnf(c_33,plain,
    sum(additive_identity,c,additive_identity),
    inference(clausify,[status(thm)],[sum_7]) ).

cnf(c_36,plain,
    ( ~ sum(D,B,D)
    | ~ sum(C,D,A)
    | sum(A,B,A) ),
    inference(factor,[status(thm)],[c_2]) ).

cnf(c_42,plain,
    ( ~ product(D,E,B)
    | ~ product(C,E,A)
    | ~ sum(C,D,C)
    | sum(A,B,A) ),
    inference(factor,[status(thm)],[c_11]) ).

cnf(c_55,plain,
    ( ~ product(B,C,A)
    | ~ sum(B,B,B)
    | sum(A,A,A) ),
    inference(factor,[status(thm)],[c_42]) ).

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

cnf(c_101,plain,
    sum(additive_inverse(a),a,additive_identity),
    inference(resolve,[status(thm)],[c_27,c_4]) ).

cnf(c_1925,plain,
    ( sum(additive_identity,b,additive_identity)
    | product(multiplicative_inverse(b),b,multiplicative_identity) ),
    inference(resolve,[status(thm)],[c_28,c_9]) ).

cnf(c_115,plain,
    product(multiplicative_inverse(b),b,multiplicative_identity),
    inference(resolve,[status(thm)],[c_31,c_1925]) ).

cnf(c_132,plain,
    sum(additive_identity,c,c),
    inference(resolve,[status(thm)],[c_29,c_3]) ).

cnf(c_156,plain,
    ( ~ sum(C,additive_identity,B)
    | ~ sum(C,additive_identity,A)
    | sum(A,c,B) ),
    inference(resolve,[status(thm)],[c_33,c_2]) ).

cnf(c_165,plain,
    ( ~ sum(B,additive_identity,A)
    | sum(A,c,A) ),
    inference(factor,[status(thm)],[c_156]) ).

cnf(c_335,plain,
    product(a,multiplicative_identity,a),
    inference(resolve,[status(thm)],[c_100,c_10]) ).

cnf(c_455,plain,
    sum(c,additive_identity,c),
    inference(resolve,[status(thm)],[c_132,c_5]) ).

cnf(c_1110,plain,
    sum(c,c,c),
    inference(resolve,[status(thm)],[c_165,c_455]) ).

cnf(c_1926,plain,
    ( ~ sum(B,a,B)
    | ~ sum(A,B,additive_identity) ),
    inference(resolve,[status(thm)],[c_36,c_30]) ).

cnf(c_1381,plain,
    ~ sum(a,a,a),
    inference(resolve,[status(thm)],[c_1926,c_101]) ).

cnf(c_1629,plain,
    product(b,multiplicative_inverse(b),multiplicative_identity),
    inference(resolve,[status(thm)],[c_115,c_10]) ).

cnf(c_1927,plain,
    ( ~ product(A,B,a)
    | ~ sum(A,A,A) ),
    inference(resolve,[status(thm)],[c_55,c_1381]) ).

cnf(c_1781,plain,
    ~ product(c,A,a),
    inference(resolve,[status(thm)],[c_1927,c_1110]) ).

cnf(c_1928,plain,
    ( ~ product(A,D,a)
    | ~ product(B,C,D)
    | ~ product(A,B,c) ),
    inference(resolve,[status(thm)],[c_7,c_1781]) ).

cnf(c_1929,plain,
    ( ~ product(a,B,a)
    | ~ product(b,A,B) ),
    inference(resolve,[status(thm)],[c_1928,c_32]) ).

cnf(c_1923,plain,
    ~ product(b,A,multiplicative_identity),
    inference(resolve,[status(thm)],[c_1929,c_335]) ).

cnf(c_1924,plain,
    $false,
    inference(resolve,[status(thm)],[c_1923,c_1629]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD041-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n017.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % 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:22:04 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 2134098 was started by sandbox2 on n017,
% 0.10/0.37  % Sun Sep 27 02:22:04 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 2.55/0.76  
% 2.55/0.76  % SZS status Unsatisfiable for theBenchmark
% 2.55/0.76  
% 2.55/0.76  % Proof 1 at 0.29 (+ 0.08) seconds.
% 2.55/0.76  % Length of proof is 33.
% 2.55/0.76  % Level of proof is 6.
% 2.55/0.76  % Maximum clause weight is 25.000.
% 2.55/0.76  % Given clauses 350.
% 2.55/0.76  
% 2.55/0.76  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------