↑ Up

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

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

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

% Result   : Unsatisfiable 14.21s 2.29s
% Output   : CNFRefutation 14.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (  18 unt;   0 def)
%            Number of atoms       :   36 (  22 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  10   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    2 (   0 sgn   1   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(clause84,axiom,
    ! [VAR_0] :
      ( nil = VAR_0
      | ~ ssList(VAR_0)
      | ~ frontsegP(nil,VAR_0) ),
    file('theBenchmark.p',clause84) ).

cnf(c_125,plain,
    ( nil = A
    | ~ ssList(A)
    | ~ frontsegP(nil,A) ),
    inference(clausify,[status(thm)],[clause84]) ).

fof(co1_3,axiom,
    ssList(sk3),
    file('theBenchmark.p',co1_3) ).

cnf(c_208,plain,
    ssList(sk3),
    inference(clausify,[status(thm)],[co1_3]) ).

fof(co1_5,axiom,
    nil = sk2,
    file('theBenchmark.p',co1_5) ).

cnf(c_210,plain,
    nil = sk2,
    inference(clausify,[status(thm)],[co1_5]) ).

cnf(c_211,plain,
    sk2 = nil,
    inference(copy,[status(thm)],[c_210]) ).

fof(co1_6,axiom,
    sk2 = sk4,
    file('theBenchmark.p',co1_6) ).

cnf(c_212,plain,
    sk2 = sk4,
    inference(clausify,[status(thm)],[co1_6]) ).

cnf(c_7061,plain,
    nil = sk4,
    inference(paramod,[status(thm)],[c_211,c_212]) ).

cnf(c_213,plain,
    sk4 = nil,
    inference(copy,[status(thm)],[c_7061]) ).

fof(co1_7,axiom,
    sk1 = sk3,
    file('theBenchmark.p',co1_7) ).

cnf(c_214,plain,
    sk1 = sk3,
    inference(clausify,[status(thm)],[co1_7]) ).

fof(co1_8,axiom,
    nil != sk1,
    file('theBenchmark.p',co1_8) ).

cnf(c_215,plain,
    nil != sk1,
    inference(clausify,[status(thm)],[co1_8]) ).

cnf(c_7062,plain,
    nil != sk3,
    inference(paramod,[status(thm)],[c_214,c_215]) ).

cnf(c_216,plain,
    sk3 != nil,
    inference(copy,[status(thm)],[c_7062]) ).

fof(co1_12,axiom,
    ( frontsegP(sk4,sk3)
    | nil = sk3 ),
    file('theBenchmark.p',co1_12) ).

cnf(c_218,plain,
    ( frontsegP(sk4,sk3)
    | nil = sk3 ),
    inference(clausify,[status(thm)],[co1_12]) ).

cnf(c_7063,plain,
    ( frontsegP(nil,sk3)
    | nil = sk3 ),
    inference(paramod,[status(thm)],[c_213,c_218]) ).

cnf(c_7064,plain,
    ( frontsegP(nil,sk3)
    | sk3 = nil ),
    inference(copy,[status(thm)],[c_7063]) ).

cnf(c_219,plain,
    frontsegP(nil,sk3),
    inference(resolve,[status(thm)],[c_216,c_7064]) ).

cnf(c_7065,plain,
    ( nil = sk3
    | ~ frontsegP(nil,sk3) ),
    inference(resolve,[status(thm)],[c_208,c_125]) ).

cnf(c_7066,plain,
    ( sk3 = nil
    | ~ frontsegP(nil,sk3) ),
    inference(copy,[status(thm)],[c_7065]) ).

cnf(c_7067,plain,
    sk3 = nil,
    inference(resolve,[status(thm)],[c_219,c_7066]) ).

cnf(c_7060,plain,
    $false,
    inference(resolve,[status(thm)],[c_216,c_7067]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC038-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n018.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 26 12:09:22 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.37  % Process 403333 was started by sandbox2 on n018,
% 0.08/0.37  % Sat Sep 26 12:09:22 2026
% 0.08/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.38  
% 0.08/0.38  % From the command line: assign(max_seconds, 300).
% 14.21/2.29  
% 14.21/2.29  % SZS status Unsatisfiable for theBenchmark
% 14.21/2.29  
% 14.21/2.29  % Proof 1 at 1.48 (+ 0.32) seconds.
% 14.21/2.29  % Length of proof is 12.
% 14.21/2.29  % Level of proof is 4.
% 14.21/2.29  % Maximum clause weight is 10.000.
% 14.21/2.29  % Given clauses 158.
% 14.21/2.29  
% 14.21/2.29  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------