↑ Up

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

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

% Result   : Unsatisfiable 1.00s 0.53s
% Output   : CNFRefutation 1.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (  16 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   45 (  27   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   30 (   0 sgn  11   !;   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(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(sum_3,axiom,
    sum(additive_identity,additive_inverse(a),additive_inverse(b)),
    file('theBenchmark.p',sum_3) ).

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

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

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

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

cnf(c_114,plain,
    sum(additive_inverse(b),b,additive_identity),
    inference(resolve,[status(thm)],[c_28,c_4]) ).

cnf(c_115,plain,
    sum(additive_identity,b,b),
    inference(resolve,[status(thm)],[c_28,c_3]) ).

cnf(c_325,plain,
    sum(b,additive_identity,b),
    inference(resolve,[status(thm)],[c_115,c_5]) ).

cnf(c_1577,plain,
    ( ~ sum(A,C,b)
    | ~ sum(B,a,C)
    | ~ sum(A,B,additive_identity) ),
    inference(resolve,[status(thm)],[c_2,c_30]) ).

cnf(c_1578,plain,
    ( ~ sum(A,additive_identity,b)
    | ~ sum(A,additive_inverse(a),additive_identity) ),
    inference(resolve,[status(thm)],[c_1577,c_98]) ).

cnf(c_962,plain,
    ~ sum(b,additive_inverse(a),additive_identity),
    inference(resolve,[status(thm)],[c_1578,c_325]) ).

cnf(c_1579,plain,
    ( ~ sum(A,C,additive_identity)
    | ~ sum(B,additive_inverse(a),C)
    | ~ sum(A,B,b) ),
    inference(resolve,[status(thm)],[c_2,c_962]) ).

cnf(c_1580,plain,
    ( ~ sum(b,A,additive_identity)
    | ~ sum(additive_identity,additive_inverse(a),A) ),
    inference(resolve,[status(thm)],[c_1579,c_325]) ).

cnf(c_1234,plain,
    ~ sum(b,additive_inverse(b),additive_identity),
    inference(resolve,[status(thm)],[c_1580,c_29]) ).

cnf(c_1581,plain,
    ~ sum(additive_inverse(b),b,additive_identity),
    inference(resolve,[status(thm)],[c_5,c_1234]) ).

cnf(c_1576,plain,
    $false,
    inference(resolve,[status(thm)],[c_114,c_1581]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD015-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.10/0.35  % Computer : n014.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sun Sep 27 02:22:16 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36  % Process 387328 was started by sandbox2 on n014,
% 0.10/0.36  % Sun Sep 27 02:22:16 2026
% 0.10/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.36  
% 0.10/0.36  % From the command line: assign(max_seconds, 300).
% 1.00/0.53  
% 1.00/0.53  % SZS status Unsatisfiable for theBenchmark
% 1.00/0.53  
% 1.00/0.53  % Proof 1 at 0.12 (+ 0.03) seconds.
% 1.00/0.53  % Length of proof is 15.
% 1.00/0.53  % Level of proof is 5.
% 1.00/0.53  % Maximum clause weight is 21.000.
% 1.00/0.53  % Given clauses 245.
% 1.00/0.53  
% 1.00/0.53  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------