↑ Up

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

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

% Computer : n004.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 06:55:00 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.44s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (  15 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   59 (  31   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   65 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(closure_of_addition,axiom,
    ! [VAR_0,VAR_1] : sum(VAR_0,VAR_1,add(VAR_0,VAR_1)),
    file('theBenchmark.p',closure_of_addition) ).

cnf(c_1,plain,
    sum(A,B,add(A,B)),
    inference(clausify,[status(thm)],[closure_of_addition]) ).

fof(additive_identity1,axiom,
    ! [VAR_0] : sum(additive_identity,VAR_0,VAR_0),
    file('theBenchmark.p',additive_identity1) ).

cnf(c_5,plain,
    sum(additive_identity,A,A),
    inference(clausify,[status(thm)],[additive_identity1]) ).

fof(multiplicative_identity2,axiom,
    ! [VAR_0] : product(VAR_0,multiplicative_identity,VAR_0),
    file('theBenchmark.p',multiplicative_identity2) ).

cnf(c_8,plain,
    product(A,multiplicative_identity,A),
    inference(clausify,[status(thm)],[multiplicative_identity2]) ).

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_11,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(distributivity7,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6] :
      ( product(VAR_2,VAR_4,VAR_6)
      | ~ sum(VAR_5,VAR_1,VAR_6)
      | ~ product(VAR_0,VAR_3,VAR_5)
      | ~ sum(VAR_3,VAR_1,VAR_4)
      | ~ sum(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',distributivity7) ).

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

fof(additive_inverse1,axiom,
    ! [VAR_0] : sum(inverse(VAR_0),VAR_0,multiplicative_identity),
    file('theBenchmark.p',additive_inverse1) ).

cnf(c_17,plain,
    sum(inverse(A),A,multiplicative_identity),
    inference(clausify,[status(thm)],[additive_inverse1]) ).

fof(multiplicative_inverse2,axiom,
    ! [VAR_0] : product(VAR_0,inverse(VAR_0),additive_identity),
    file('theBenchmark.p',multiplicative_inverse2) ).

cnf(c_20,plain,
    product(A,inverse(A),additive_identity),
    inference(clausify,[status(thm)],[multiplicative_inverse2]) ).

fof(prove_both_equalities,axiom,
    ~ sum(x,x,x),
    file('theBenchmark.p',prove_both_equalities) ).

cnf(c_23,plain,
    ~ sum(x,x,x),
    inference(clausify,[status(thm)],[prove_both_equalities]) ).

cnf(c_854,plain,
    ( product(add(D,B),C,F)
    | ~ sum(E,B,F)
    | ~ product(D,A,E)
    | ~ sum(A,B,C) ),
    inference(resolve,[status(thm)],[c_15,c_1]) ).

cnf(c_855,plain,
    ( product(add(A,B),multiplicative_identity,D)
    | ~ sum(C,B,D)
    | ~ product(A,inverse(B),C) ),
    inference(resolve,[status(thm)],[c_854,c_17]) ).

cnf(c_856,plain,
    ( product(add(A,A),multiplicative_identity,B)
    | ~ sum(additive_identity,A,B) ),
    inference(resolve,[status(thm)],[c_855,c_20]) ).

cnf(c_693,plain,
    product(add(A,A),multiplicative_identity,A),
    inference(resolve,[status(thm)],[c_856,c_5]) ).

cnf(c_857,plain,
    ( sum(C,B,E)
    | ~ product(D,multiplicative_identity,E)
    | ~ sum(C,A,D)
    | ~ product(A,multiplicative_identity,B) ),
    inference(resolve,[status(thm)],[c_11,c_8]) ).

cnf(c_858,plain,
    ( sum(A,B,D)
    | ~ product(C,multiplicative_identity,D)
    | ~ sum(A,B,C) ),
    inference(resolve,[status(thm)],[c_857,c_8]) ).

cnf(c_859,plain,
    ( sum(A,B,C)
    | ~ product(add(A,B),multiplicative_identity,C) ),
    inference(resolve,[status(thm)],[c_858,c_1]) ).

cnf(c_852,plain,
    ~ product(add(x,x),multiplicative_identity,x),
    inference(resolve,[status(thm)],[c_859,c_23]) ).

cnf(c_853,plain,
    $false,
    inference(resolve,[status(thm)],[c_852,c_693]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : BOO004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n004.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 22:34:21 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35  % Process 2794646 was started by sandbox2 on n004,
% 0.08/0.35  % Sat Sep 26 22:34:21 2026
% 0.08/0.35  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.36  
% 0.08/0.36  % From the command line: assign(max_seconds, 300).
% 0.12/0.44  
% 0.12/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.44  
% 0.12/0.44  % Proof 1 at 0.06 (+ 0.01) seconds.
% 0.12/0.44  % Length of proof is 11.
% 0.12/0.44  % Level of proof is 2.
% 0.12/0.44  % Maximum clause weight is 20.000.
% 0.12/0.44  % Given clauses 23.
% 0.12/0.44  
% 0.12/0.44  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------