↑ Up

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

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

% Result   : Unsatisfiable 0.13s 0.41s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (  12 unt;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   27 (  16   ~;  11   |;   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    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   18 (   0 sgn   7   !;   0   ?)

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

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

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

cnf(c_14,plain,
    defined(additive_identity),
    inference(clausify,[status(thm)],[well_definedness_of_additive_identity]) ).

fof(well_definedness_of_multiplicative_identity,axiom,
    defined(multiplicative_identity),
    file('theBenchmark.p',well_definedness_of_multiplicative_identity) ).

cnf(c_17,plain,
    defined(multiplicative_identity),
    inference(clausify,[status(thm)],[well_definedness_of_multiplicative_identity]) ).

fof(different_identities,axiom,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    file('theBenchmark.p',different_identities) ).

cnf(c_26,plain,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    inference(clausify,[status(thm)],[different_identities]) ).

fof(sum_3,axiom,
    sum(additive_identity,multiplicative_identity,additive_identity),
    file('theBenchmark.p',sum_3) ).

cnf(c_29,plain,
    sum(additive_identity,multiplicative_identity,additive_identity),
    inference(clausify,[status(thm)],[sum_3]) ).

cnf(c_58,plain,
    sum(additive_identity,additive_identity,additive_identity),
    inference(resolve,[status(thm)],[c_14,c_3]) ).

cnf(c_71,plain,
    sum(additive_identity,multiplicative_identity,multiplicative_identity),
    inference(resolve,[status(thm)],[c_17,c_3]) ).

cnf(c_193,plain,
    ( ~ sum(B,C,multiplicative_identity)
    | ~ sum(A,C,additive_identity)
    | ~ sum(additive_identity,A,B) ),
    inference(resolve,[status(thm)],[c_1,c_26]) ).

cnf(c_194,plain,
    ( ~ sum(additive_identity,A,multiplicative_identity)
    | ~ sum(additive_identity,A,additive_identity) ),
    inference(resolve,[status(thm)],[c_193,c_58]) ).

cnf(c_195,plain,
    ~ sum(additive_identity,multiplicative_identity,multiplicative_identity),
    inference(resolve,[status(thm)],[c_194,c_29]) ).

cnf(c_192,plain,
    $false,
    inference(resolve,[status(thm)],[c_71,c_195]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD039-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n016.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 27 02:31:02 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 2228223 was started by sandbox2 on n016,
% 0.09/0.37  % Sun Sep 27 02:31:02 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.38  
% 0.13/0.38  % From the command line: assign(max_seconds, 300).
% 0.13/0.41  
% 0.13/0.41  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.41  
% 0.13/0.41  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.13/0.41  % Length of proof is 9.
% 0.13/0.41  % Level of proof is 2.
% 0.13/0.41  % Maximum clause weight is 21.000.
% 0.13/0.41  % Given clauses 62.
% 0.13/0.41  
% 0.13/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------