↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWC051-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 : n015.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:41 AM UTC 2026

% Result   : Unsatisfiable 12.37s 2.09s
% Output   : CNFRefutation 12.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   28 (  18 unt;   0 def)
%            Number of atoms       :   43 (   4 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   36 (  21   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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_11,axiom,
    ( rearsegP(sk4,sk3)
    | ~ neq(sk4,nil) ),
    file('theBenchmark.p',co1_11) ).

cnf(c_51,plain,
    ( rearsegP(sk4,sk3)
    | ~ neq(sk4,nil) ),
    inference(clausify,[status(thm)],[co1_11]) ).

fof(co1_10,axiom,
    ( neq(sk3,nil)
    | ~ neq(sk4,nil) ),
    file('theBenchmark.p',co1_10) ).

cnf(c_52,plain,
    ( neq(sk3,nil)
    | ~ neq(sk4,nil) ),
    inference(clausify,[status(thm)],[co1_10]) ).

fof(co1_8,axiom,
    ! [VAR_0] :
      ( ~ rearsegP(sk1,VAR_0)
      | ~ rearsegP(sk2,VAR_0)
      | ~ neq(VAR_0,nil)
      | ~ ssList(VAR_0) ),
    file('theBenchmark.p',co1_8) ).

cnf(c_55,plain,
    ( ~ rearsegP(sk1,A)
    | ~ rearsegP(sk2,A)
    | ~ neq(A,nil)
    | ~ ssList(A) ),
    inference(clausify,[status(thm)],[co1_8]) ).

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

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

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

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

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

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

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

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

fof(co1_1,axiom,
    ssList(sk1),
    file('theBenchmark.p',co1_1) ).

cnf(c_62,plain,
    ssList(sk1),
    inference(clausify,[status(thm)],[co1_1]) ).

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

cnf(c_164,plain,
    ( rearsegP(A,A)
    | ~ ssList(A) ),
    inference(clausify,[status(thm)],[clause59]) ).

cnf(c_827,plain,
    neq(sk4,nil),
    inference(paramod,[status(thm)],[c_58,c_56]) ).

cnf(c_828,plain,
    neq(sk3,nil),
    inference(resolve,[status(thm)],[c_827,c_52]) ).

cnf(c_829,plain,
    rearsegP(sk4,sk3),
    inference(resolve,[status(thm)],[c_827,c_51]) ).

cnf(c_1098,plain,
    rearsegP(sk1,sk1),
    inference(resolve,[status(thm)],[c_164,c_62]) ).

cnf(c_5370,plain,
    ( ~ rearsegP(sk1,sk3)
    | ~ rearsegP(sk2,sk3)
    | ~ ssList(sk3) ),
    inference(resolve,[status(thm)],[c_828,c_55]) ).

cnf(c_4794,plain,
    ( ~ rearsegP(sk1,sk3)
    | ~ rearsegP(sk2,sk3) ),
    inference(resolve,[status(thm)],[c_60,c_5370]) ).

cnf(c_5053,plain,
    rearsegP(sk1,sk3),
    inference(paramod,[status(thm)],[c_57,c_1098]) ).

cnf(c_5054,plain,
    ~ rearsegP(sk2,sk3),
    inference(resolve,[status(thm)],[c_5053,c_4794]) ).

cnf(c_5371,plain,
    ~ rearsegP(sk4,sk3),
    inference(paramod,[status(thm)],[c_58,c_5054]) ).

cnf(c_5369,plain,
    $false,
    inference(resolve,[status(thm)],[c_829,c_5371]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC051-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.16/0.42  % Computer : n015.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Sat Sep 26 12:11:28 UTC 2026
% 0.16/0.43  % CPUTime  : 
% 0.16/0.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.43  % Process 3991406 was started by sandbox on n015,
% 0.16/0.43  % Sat Sep 26 12:11:28 2026
% 0.16/0.43  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/0.44  
% 0.16/0.44  % From the command line: assign(max_seconds, 300).
% 12.37/2.09  
% 12.37/2.09  % given #500 (I,wt=35): 556 app(app(A,cons(B,C)),cons(B,D)) != A | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | lt(B,B) | -lt(skaf59(A),skaf60(A)).  [factor(295,e,f),merge(g)].
% 12.37/2.09  
% 12.37/2.09  % SZS status Unsatisfiable for theBenchmark
% 12.37/2.09  
% 12.37/2.09  % Proof 1 at 1.27 (+ 0.35) seconds.
% 12.37/2.09  % Length of proof is 17.
% 12.37/2.09  % Level of proof is 5.
% 12.37/2.09  % Maximum clause weight is 13.000.
% 12.37/2.09  % Given clauses 798.
% 12.37/2.09  
% 12.37/2.09  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------