↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWC358-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 : n014.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:57:35 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(co1_7,axiom,
    neq(sk2,nil),
    file('theBenchmark.p',co1_7) ).

cnf(c_30,plain,
    neq(sk2,nil),
    inference(clausify,[status(thm)],[co1_7]) ).

fof(clause115,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ ssList(VAR_0)
      | ~ ssList(VAR_1)
      | ~ neq(VAR_0,VAR_1)
      | VAR_0 != VAR_1 ),
    file('theBenchmark.p',clause115) ).

cnf(c_33,plain,
    ( ~ ssList(A)
    | ~ ssList(B)
    | ~ neq(A,B)
    | A != B ),
    inference(clausify,[status(thm)],[clause115]) ).

cnf(c_39,plain,
    ( ~ ssList(sk2)
    | ~ ssList(nil)
    | sk2 != nil ),
    inference(resolve,[status(thm)],[c_33,c_30]) ).

fof(clause8,axiom,
    ssList(nil),
    file('theBenchmark.p',clause8) ).

cnf(c_60,plain,
    ssList(nil),
    inference(clausify,[status(thm)],[clause8]) ).

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

cnf(c_213,plain,
    sk2 = sk4,
    inference(clausify,[status(thm)],[co1_5]) ).

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

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

fof(co1_8,axiom,
    ~ segmentP(sk2,sk1),
    file('theBenchmark.p',co1_8) ).

cnf(c_215,plain,
    ~ segmentP(sk2,sk1),
    inference(clausify,[status(thm)],[co1_8]) ).

cnf(c_306,plain,
    ~ segmentP(sk4,sk1),
    inference(paramod,[status(thm)],[c_213,c_215]) ).

cnf(c_216,plain,
    ~ segmentP(sk4,sk3),
    inference(paramod,[status(thm)],[c_214,c_306]) ).

fof(co1_10,axiom,
    ( segmentP(sk4,sk3)
    | nil = sk4 ),
    file('theBenchmark.p',co1_10) ).

cnf(c_217,plain,
    ( segmentP(sk4,sk3)
    | nil = sk4 ),
    inference(clausify,[status(thm)],[co1_10]) ).

cnf(c_307,plain,
    ( segmentP(sk4,sk3)
    | sk4 = nil ),
    inference(copy,[status(thm)],[c_217]) ).

cnf(c_218,plain,
    sk4 = nil,
    inference(resolve,[status(thm)],[c_216,c_307]) ).

cnf(c_308,plain,
    ( ~ ssList(sk2)
    | ~ ssList(nil)
    | sk4 != nil ),
    inference(paramod,[status(thm)],[c_213,c_39]) ).

cnf(c_309,plain,
    ( ~ ssList(sk2)
    | ~ ssList(nil)
    | nil != nil ),
    inference(paramod,[status(thm)],[c_218,c_308]) ).

cnf(c_310,plain,
    ( ~ ssList(sk4)
    | ~ ssList(nil)
    | nil != nil ),
    inference(paramod,[status(thm)],[c_213,c_309]) ).

cnf(c_311,plain,
    ( ~ ssList(nil)
    | ~ ssList(nil)
    | nil != nil ),
    inference(paramod,[status(thm)],[c_218,c_310]) ).

cnf(c_312,plain,
    ( ~ ssList(nil)
    | ~ ssList(nil) ),
    inference(copy,[status(thm)],[c_311]) ).

cnf(c_313,plain,
    ~ ssList(nil),
    inference(copy,[status(thm)],[c_312]) ).

cnf(c_305,plain,
    $false,
    inference(resolve,[status(thm)],[c_60,c_313]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC358-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/5.45  % Computer : n014.cluster.edu
% 0.19/5.45  % Model    : x86_64 x86_64
% 0.19/5.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.45  % Memory   : 8046.5625MB
% 0.19/5.45  % OS       : Linux 6.8.0-71-generic
% 0.19/5.45  % CPULimit : 300
% 0.19/5.45  % WCLimit  : 300
% 0.19/5.45  % DateTime : Sat Sep 26 12:52:53 UTC 2026
% 0.19/5.46  % CPUTime  : 
% 0.19/5.46  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/5.46  % Process 3196382 was started by sandbox2 on n014,
% 0.19/5.46  % Sat Sep 26 12:52:53 2026
% 0.19/5.46  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.19/5.47  
% 0.19/5.47  % From the command line: assign(max_seconds, 300).
% 0.23/5.54  
% 0.23/5.54  % SZS status Unsatisfiable for theBenchmark
% 0.23/5.54  
% 0.23/5.54  % Proof 1 at 0.04 (+ 0.01) seconds.
% 0.23/5.54  % Length of proof is 11.
% 0.23/5.54  % Level of proof is 3.
% 0.23/5.54  % Maximum clause weight is 7.000.
% 0.23/5.54  % Given clauses 0.
% 0.23/5.54  
% 0.23/5.54  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------