↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : RNG040-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n011.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 08:26:28 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.39s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   17 (  12 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   31 (  17   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   21 (   0 sgn   7   !;   0   ?)

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

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

fof(b_plus_c,axiom,
    sum(b,c,d),
    file('theBenchmark.p',b_plus_c) ).

cnf(c_25,plain,
    sum(b,c,d),
    inference(clausify,[status(thm)],[b_plus_c]) ).

fof(d_plus_a,axiom,
    product(d,a,additive_identity),
    file('theBenchmark.p',d_plus_a) ).

cnf(c_26,plain,
    product(d,a,additive_identity),
    inference(clausify,[status(thm)],[d_plus_a]) ).

fof(b_plus_a,axiom,
    product(b,a,l),
    file('theBenchmark.p',b_plus_a) ).

cnf(c_27,plain,
    product(b,a,l),
    inference(clausify,[status(thm)],[b_plus_a]) ).

fof(c_plus_a,axiom,
    product(c,a,n),
    file('theBenchmark.p',c_plus_a) ).

cnf(c_28,plain,
    product(c,a,n),
    inference(clausify,[status(thm)],[c_plus_a]) ).

fof(prove_equation,axiom,
    ~ sum(l,n,additive_identity),
    file('theBenchmark.p',prove_equation) ).

cnf(c_29,plain,
    ~ sum(l,n,additive_identity),
    inference(clausify,[status(thm)],[prove_equation]) ).

cnf(c_233,plain,
    ( sum(B,n,D)
    | ~ product(C,a,D)
    | ~ sum(A,c,C)
    | ~ product(A,a,B) ),
    inference(resolve,[status(thm)],[c_14,c_28]) ).

cnf(c_234,plain,
    ( sum(A,n,B)
    | ~ product(d,a,B)
    | ~ product(b,a,A) ),
    inference(resolve,[status(thm)],[c_233,c_25]) ).

cnf(c_235,plain,
    ( sum(A,n,additive_identity)
    | ~ product(b,a,A) ),
    inference(resolve,[status(thm)],[c_234,c_26]) ).

cnf(c_236,plain,
    ~ product(b,a,l),
    inference(resolve,[status(thm)],[c_235,c_29]) ).

cnf(c_232,plain,
    $false,
    inference(resolve,[status(thm)],[c_27,c_236]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG040-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n011.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 05:51:29 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.36  % Process 3933147 was started by sandbox on n011,
% 0.13/0.36  % Sat Sep 26 05:51:29 2026
% 0.13/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.37  
% 0.13/0.37  % From the command line: assign(max_seconds, 300).
% 0.13/0.39  
% 0.13/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.39  
% 0.13/0.39  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.13/0.39  % Length of proof is 7.
% 0.13/0.39  % Level of proof is 1.
% 0.13/0.39  % Maximum clause weight is 25.000.
% 0.13/0.39  % Given clauses 27.
% 0.13/0.39  
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------