↑ Up

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

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

% Result   : Unsatisfiable 0.18s 0.47s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   28 (  15 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   54 (  29   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   28 (   0 sgn  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(transitivity_of_order_relation,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ less_or_equal(VAR_2,VAR_1)
      | ~ less_or_equal(VAR_0,VAR_2)
      | less_or_equal(VAR_0,VAR_1) ),
    file('theBenchmark.p',transitivity_of_order_relation) ).

cnf(c_22,plain,
    ( ~ less_or_equal(C,B)
    | ~ less_or_equal(A,C)
    | less_or_equal(A,B) ),
    inference(clausify,[status(thm)],[transitivity_of_order_relation]) ).

fof(totality_of_order_relation,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ defined(VAR_1)
      | ~ defined(VAR_0)
      | less_or_equal(VAR_1,VAR_0)
      | less_or_equal(VAR_0,VAR_1) ),
    file('theBenchmark.p',totality_of_order_relation) ).

cnf(c_23,plain,
    ( ~ defined(B)
    | ~ defined(A)
    | less_or_equal(B,A)
    | less_or_equal(A,B) ),
    inference(clausify,[status(thm)],[totality_of_order_relation]) ).

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

cnf(c_24,plain,
    ( ~ sum(D,E,B)
    | ~ sum(C,E,A)
    | ~ less_or_equal(C,D)
    | less_or_equal(A,B) ),
    inference(clausify,[status(thm)],[compatibility_of_order_relation_and_addition]) ).

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(less_or_equal_4,axiom,
    less_or_equal(a,b),
    file('theBenchmark.p',less_or_equal_4) ).

cnf(c_30,plain,
    less_or_equal(a,b),
    inference(clausify,[status(thm)],[less_or_equal_4]) ).

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

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

fof(not_less_or_equal_6,axiom,
    ~ less_or_equal(a,c),
    file('theBenchmark.p',not_less_or_equal_6) ).

cnf(c_32,plain,
    ~ less_or_equal(a,c),
    inference(clausify,[status(thm)],[not_less_or_equal_6]) ).

cnf(c_84,plain,
    ( ~ defined(A)
    | less_or_equal(A,additive_identity)
    | less_or_equal(additive_identity,A) ),
    inference(resolve,[status(thm)],[c_23,c_14]) ).

cnf(c_218,plain,
    ( ~ defined(additive_identity)
    | less_or_equal(additive_identity,additive_identity) ),
    inference(factor,[status(thm)],[c_84]) ).

cnf(c_86,plain,
    less_or_equal(additive_identity,additive_identity),
    inference(resolve,[status(thm)],[c_14,c_218]) ).

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

cnf(c_219,plain,
    ( ~ less_or_equal(A,c)
    | ~ less_or_equal(a,A) ),
    inference(resolve,[status(thm)],[c_22,c_32]) ).

cnf(c_148,plain,
    ~ less_or_equal(b,c),
    inference(resolve,[status(thm)],[c_219,c_30]) ).

cnf(c_220,plain,
    ( ~ sum(B,C,c)
    | ~ sum(A,C,b)
    | ~ less_or_equal(A,B) ),
    inference(resolve,[status(thm)],[c_24,c_148]) ).

cnf(c_221,plain,
    ( ~ sum(additive_identity,A,c)
    | ~ sum(additive_identity,A,b) ),
    inference(resolve,[status(thm)],[c_220,c_86]) ).

cnf(c_222,plain,
    ~ sum(additive_identity,b,b),
    inference(resolve,[status(thm)],[c_221,c_31]) ).

cnf(c_217,plain,
    $false,
    inference(resolve,[status(thm)],[c_117,c_222]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : FLD055-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43  % Computer : n002.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Sun Sep 27 02:34:35 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.44  % Process 3148353 was started by sandbox2 on n002,
% 0.18/0.44  % Sun Sep 27 02:34:35 2026
% 0.18/0.44  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.45  
% 0.18/0.45  % From the command line: assign(max_seconds, 300).
% 0.18/0.47  
% 0.18/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.47  
% 0.18/0.47  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.18/0.47  % Length of proof is 14.
% 0.18/0.47  % Level of proof is 3.
% 0.18/0.47  % Maximum clause weight is 14.000.
% 0.18/0.47  % Given clauses 61.
% 0.18/0.47  
% 0.18/0.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------