↑ Up

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

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

% Result   : Unsatisfiable 0.07s 5.57s
% Output   : CNFRefutation 0.07s
% 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_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(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(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(sum_3,axiom,
    sum(additive_identity,m,additive_identity),
    file('theBenchmark.p',sum_3) ).

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

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

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

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

cnf(c_99,plain,
    sum(additive_identity,a,a),
    inference(resolve,[status(thm)],[c_27,c_3]) ).

cnf(c_125,plain,
    ~ sum(a,m,a),
    inference(resolve,[status(thm)],[c_5,c_30]) ).

cnf(c_150,plain,
    ( ~ sum(B,m,B)
    | ~ sum(A,B,a) ),
    inference(resolve,[status(thm)],[c_33,c_125]) ).

cnf(c_147,plain,
    ~ sum(A,additive_identity,a),
    inference(resolve,[status(thm)],[c_150,c_29]) ).

cnf(c_148,plain,
    ~ sum(additive_identity,A,a),
    inference(resolve,[status(thm)],[c_5,c_147]) ).

cnf(c_149,plain,
    $false,
    inference(resolve,[status(thm)],[c_148,c_99]) ).

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