↑ Up

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

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

% Computer : n003.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 09:37:09 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.50s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   24 (  14 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   45 (  25   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   22 (   4 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_26,axiom,
    n0(d,c),
    file('theBenchmark.p',axiom_26) ).

cnf(c_5,plain,
    n0(d,c),
    inference(clausify,[status(thm)],[axiom_26]) ).

fof(rule_002,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | l1(VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_002) ).

cnf(c_10,plain,
    ( ~ n0(B,A)
    | l1(A,A) ),
    inference(clausify,[status(thm)],[rule_002]) ).

cnf(c_255,plain,
    l1(c,c),
    inference(resolve,[status(thm)],[c_10,c_5]) ).

fof(prove_this,axiom,
    ~ n1(c,d,d),
    file('theBenchmark.p',prove_this) ).

cnf(c_264,plain,
    ~ n1(c,d,d),
    inference(clausify,[status(thm)],[prove_this]) ).

fof(rule_054,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ n1(VAR_0,VAR_1,VAR_0)
      | ~ l1(VAR_2,VAR_0)
      | ~ l0(VAR_2)
      | n1(VAR_0,VAR_1,VAR_1) ),
    file('theBenchmark.p',rule_054) ).

cnf(c_427,plain,
    ( ~ n1(A,B,A)
    | ~ l1(C,A)
    | ~ l0(C)
    | n1(A,B,B) ),
    inference(clausify,[status(thm)],[rule_054]) ).

fof(rule_050,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p0(b,VAR_1)
      | ~ l0(VAR_0)
      | ~ s0(b)
      | n1(VAR_0,VAR_1,VAR_0) ),
    file('theBenchmark.p',rule_050) ).

cnf(c_431,plain,
    ( ~ p0(b,B)
    | ~ l0(A)
    | ~ s0(b)
    | n1(A,B,A) ),
    inference(clausify,[status(thm)],[rule_050]) ).

fof(axiom_24,axiom,
    l0(c),
    file('theBenchmark.p',axiom_24) ).

cnf(c_480,plain,
    l0(c),
    inference(clausify,[status(thm)],[axiom_24]) ).

fof(axiom_14,axiom,
    ! [VAR_0] : p0(b,VAR_0),
    file('theBenchmark.p',axiom_14) ).

cnf(c_489,plain,
    p0(b,A),
    inference(clausify,[status(thm)],[axiom_14]) ).

fof(axiom_5,axiom,
    s0(b),
    file('theBenchmark.p',axiom_5) ).

cnf(c_494,plain,
    s0(b),
    inference(clausify,[status(thm)],[axiom_5]) ).

cnf(c_865,plain,
    ( ~ p0(b,B)
    | ~ l0(A)
    | n1(A,B,A) ),
    inference(resolve,[status(thm)],[c_494,c_431]) ).

cnf(c_591,plain,
    ( ~ l0(A)
    | n1(A,B,A) ),
    inference(resolve,[status(thm)],[c_489,c_865]) ).

cnf(c_866,plain,
    ( ~ n1(c,d,c)
    | ~ l1(A,c)
    | ~ l0(A) ),
    inference(resolve,[status(thm)],[c_427,c_264]) ).

cnf(c_867,plain,
    ( ~ n1(c,d,c)
    | ~ l1(c,c) ),
    inference(resolve,[status(thm)],[c_866,c_480]) ).

cnf(c_734,plain,
    ~ n1(c,d,c),
    inference(resolve,[status(thm)],[c_867,c_255]) ).

cnf(c_863,plain,
    n1(c,A,c),
    inference(resolve,[status(thm)],[c_591,c_480]) ).

cnf(c_864,plain,
    $false,
    inference(resolve,[status(thm)],[c_863,c_734]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN148-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34  % Computer : n003.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sat Sep 26 17:17:24 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35  % Process 3392526 was started by sandbox2 on n003,
% 0.08/0.35  % Sat Sep 26 17:17:24 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.13/0.50  
% 0.13/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.50  
% 0.13/0.50  % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.13/0.50  % Length of proof is 13.
% 0.13/0.50  % Level of proof is 3.
% 0.13/0.50  % Maximum clause weight is 18.000.
% 0.13/0.50  % Given clauses 300.
% 0.13/0.50  
% 0.13/0.50  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------