↑ Up

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

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

% Computer : n016.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:50 AM UTC 2026

% Result   : Unsatisfiable 0.91s 0.66s
% Output   : CNFRefutation 0.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   25 (  17 unt;   0 def)
%            Number of atoms       :   33 (   8 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   23 (  15   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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   :    2 (   0 sgn   1   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1_9,axiom,
    ( ~ frontsegP(sk2,sk1)
    | ~ neq(sk1,nil) ),
    file('theBenchmark.p',co1_9) ).

cnf(c_51,plain,
    ( ~ frontsegP(sk2,sk1)
    | ~ neq(sk1,nil) ),
    inference(clausify,[status(thm)],[co1_9]) ).

fof(co1_8,axiom,
    neq(sk2,nil),
    file('theBenchmark.p',co1_8) ).

cnf(c_52,plain,
    neq(sk2,nil),
    inference(clausify,[status(thm)],[co1_8]) ).

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

cnf(c_53,plain,
    sk4 = sk3,
    inference(clausify,[status(thm)],[co1_7]) ).

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

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

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

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

cnf(c_902,plain,
    sk2 = sk3,
    inference(paramod,[status(thm)],[c_53,c_55]) ).

cnf(c_56,plain,
    sk3 = sk2,
    inference(copy,[status(thm)],[c_902]) ).

fof(co1_4,axiom,
    ssList(sk4),
    file('theBenchmark.p',co1_4) ).

cnf(c_57,plain,
    ssList(sk4),
    inference(clausify,[status(thm)],[co1_4]) ).

cnf(c_903,plain,
    ssList(sk3),
    inference(paramod,[status(thm)],[c_53,c_57]) ).

cnf(c_58,plain,
    ssList(sk2),
    inference(paramod,[status(thm)],[c_56,c_903]) ).

fof(clause61,axiom,
    ! [VAR_0] :
      ( frontsegP(VAR_0,VAR_0)
      | ~ ssList(VAR_0) ),
    file('theBenchmark.p',clause61) ).

cnf(c_160,plain,
    ( frontsegP(A,A)
    | ~ ssList(A) ),
    inference(clausify,[status(thm)],[clause61]) ).

cnf(c_904,plain,
    ( ~ frontsegP(sk2,sk1)
    | ~ neq(sk3,nil) ),
    inference(paramod,[status(thm)],[c_54,c_51]) ).

cnf(c_905,plain,
    ( ~ frontsegP(sk2,sk1)
    | ~ neq(sk2,nil) ),
    inference(paramod,[status(thm)],[c_56,c_904]) ).

cnf(c_906,plain,
    ( ~ frontsegP(sk2,sk3)
    | ~ neq(sk2,nil) ),
    inference(paramod,[status(thm)],[c_54,c_905]) ).

cnf(c_907,plain,
    ( ~ frontsegP(sk2,sk2)
    | ~ neq(sk2,nil) ),
    inference(paramod,[status(thm)],[c_56,c_906]) ).

cnf(c_317,plain,
    ~ frontsegP(sk2,sk2),
    inference(resolve,[status(thm)],[c_52,c_907]) ).

cnf(c_908,plain,
    frontsegP(sk2,sk2),
    inference(resolve,[status(thm)],[c_160,c_58]) ).

cnf(c_901,plain,
    $false,
    inference(resolve,[status(thm)],[c_317,c_908]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC102-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n016.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sat Sep 26 12:20:16 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43  % Process 848691 was started by sandbox on n016,
% 0.17/0.43  % Sat Sep 26 12:20:16 2026
% 0.17/0.43  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.45  
% 0.17/0.45  % From the command line: assign(max_seconds, 300).
% 0.91/0.66  
% 0.91/0.66  % SZS status Unsatisfiable for theBenchmark
% 0.91/0.66  
% 0.91/0.66  % Proof 1 at 0.16 (+ 0.04) seconds.
% 0.91/0.66  % Length of proof is 11.
% 0.91/0.66  % Level of proof is 3.
% 0.91/0.66  % Maximum clause weight is 11.000.
% 0.91/0.66  % Given clauses 113.
% 0.91/0.66  
% 0.91/0.66  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------