↑ Up

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

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

% Result   : Unsatisfiable 105.56s 14.78s
% Output   : CNFRefutation 105.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   75 (  30 unt;   0 def)
%            Number of atoms       :  191 (  45 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  221 ( 105   ~; 116   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   72 (  13 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(clause179,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
      ( ~ ssList(VAR_4)
      | ~ duplicatefreeP(VAR_4)
      | ~ ssItem(VAR_1)
      | ~ ssList(VAR_0)
      | ~ ssList(VAR_2)
      | ~ ssList(VAR_3)
      | app(app(VAR_0,cons(VAR_1,VAR_2)),cons(VAR_1,VAR_3)) != VAR_4 ),
    file('theBenchmark.p',clause179) ).

cnf(c_7,plain,
    ( ~ ssList(E)
    | ~ duplicatefreeP(E)
    | ~ ssItem(B)
    | ~ ssList(A)
    | ~ ssList(C)
    | ~ ssList(D)
    | app(app(A,cons(B,C)),cons(B,D)) != E ),
    inference(clausify,[status(thm)],[clause179]) ).

fof(clause72,axiom,
    ! [VAR_0,VAR_1] :
      ( ssItem(VAR_1)
      | duplicatefreeP(VAR_0)
      | ~ ssList(VAR_0) ),
    file('theBenchmark.p',clause72) ).

cnf(c_8,plain,
    ( ssItem(B)
    | duplicatefreeP(A)
    | ~ ssList(A) ),
    inference(clausify,[status(thm)],[clause72]) ).

cnf(c_43,plain,
    ( ~ ssList(A)
    | ~ ssItem(D)
    | ~ ssList(C)
    | ~ ssList(E)
    | ~ ssList(F)
    | app(app(C,cons(D,E)),cons(D,F)) != A
    | ssItem(B)
    | ~ ssList(A) ),
    inference(resolve,[status(thm)],[c_8,c_7]) ).

cnf(c_44,plain,
    ( ~ ssItem(D)
    | ~ ssList(C)
    | ~ ssList(E)
    | ~ ssList(F)
    | app(app(C,cons(D,E)),cons(D,F)) != A
    | ssItem(B)
    | ~ ssList(A) ),
    inference(copy,[status(thm)],[c_43]) ).

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

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

fof(clause71,axiom,
    ! [VAR_0] :
      ( ~ ssItem(VAR_0)
      | ~ memberP(nil,VAR_0) ),
    file('theBenchmark.p',clause71) ).

cnf(c_107,plain,
    ( ~ ssItem(A)
    | ~ memberP(nil,A) ),
    inference(clausify,[status(thm)],[clause71]) ).

fof(clause74,axiom,
    ! [VAR_0] :
      ( app(nil,VAR_0) = VAR_0
      | ~ ssList(VAR_0) ),
    file('theBenchmark.p',clause74) ).

cnf(c_109,plain,
    ( app(nil,A) = A
    | ~ ssList(A) ),
    inference(clausify,[status(thm)],[clause74]) ).

fof(clause85,axiom,
    ! [VAR_0,VAR_1] :
      ( ssList(app(VAR_1,VAR_0))
      | ~ ssList(VAR_1)
      | ~ ssList(VAR_0) ),
    file('theBenchmark.p',clause85) ).

cnf(c_118,plain,
    ( ssList(app(B,A))
    | ~ ssList(B)
    | ~ ssList(A) ),
    inference(clausify,[status(thm)],[clause85]) ).

fof(clause98,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ ssList(VAR_1)
      | ~ ssItem(VAR_0)
      | cons(VAR_0,VAR_1) != nil ),
    file('theBenchmark.p',clause98) ).

cnf(c_124,plain,
    ( ~ ssList(B)
    | ~ ssItem(A)
    | cons(A,B) != nil ),
    inference(clausify,[status(thm)],[clause98]) ).

fof(clause161,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( VAR_2 = VAR_0
      | memberP(VAR_1,VAR_2)
      | ~ ssItem(VAR_2)
      | ~ ssItem(VAR_0)
      | ~ ssList(VAR_1)
      | ~ memberP(cons(VAR_0,VAR_1),VAR_2) ),
    file('theBenchmark.p',clause161) ).

cnf(c_182,plain,
    ( C = A
    | memberP(B,C)
    | ~ ssItem(C)
    | ~ ssItem(A)
    | ~ ssList(B)
    | ~ memberP(cons(A,B),C) ),
    inference(clausify,[status(thm)],[clause161]) ).

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

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

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

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

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

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

fof(co1_7,axiom,
    ssItem(sk5),
    file('theBenchmark.p',co1_7) ).

cnf(c_204,plain,
    ssItem(sk5),
    inference(clausify,[status(thm)],[co1_7]) ).

fof(co1_8,axiom,
    memberP(sk1,sk5),
    file('theBenchmark.p',co1_8) ).

cnf(c_205,plain,
    memberP(sk1,sk5),
    inference(clausify,[status(thm)],[co1_8]) ).

cnf(c_206,plain,
    memberP(sk3,sk5),
    inference(paramod,[status(thm)],[c_203,c_205]) ).

fof(co1_9,axiom,
    ~ memberP(sk2,sk5),
    file('theBenchmark.p',co1_9) ).

cnf(c_207,plain,
    ~ memberP(sk2,sk5),
    inference(clausify,[status(thm)],[co1_9]) ).

cnf(c_208,plain,
    ~ memberP(sk4,sk5),
    inference(paramod,[status(thm)],[c_202,c_207]) ).

fof(co1_11,axiom,
    ( nil = sk3
    | ssItem(sk6) ),
    file('theBenchmark.p',co1_11) ).

cnf(c_211,plain,
    ( nil = sk3
    | ssItem(sk6) ),
    inference(clausify,[status(thm)],[co1_11]) ).

cnf(c_212,plain,
    ( sk3 = nil
    | ssItem(sk6) ),
    inference(copy,[status(thm)],[c_211]) ).

fof(co1_14,axiom,
    ( nil = sk3
    | cons(sk6,nil) = sk3 ),
    file('theBenchmark.p',co1_14) ).

cnf(c_217,plain,
    ( nil = sk3
    | cons(sk6,nil) = sk3 ),
    inference(clausify,[status(thm)],[co1_14]) ).

cnf(c_218,plain,
    ( sk3 = nil
    | cons(sk6,nil) = sk3 ),
    inference(copy,[status(thm)],[c_217]) ).

fof(co1_15,axiom,
    ( nil = sk3
    | memberP(sk4,sk6) ),
    file('theBenchmark.p',co1_15) ).

cnf(c_219,plain,
    ( nil = sk3
    | memberP(sk4,sk6) ),
    inference(clausify,[status(thm)],[co1_15]) ).

cnf(c_220,plain,
    ( sk3 = nil
    | memberP(sk4,sk6) ),
    inference(copy,[status(thm)],[c_219]) ).

cnf(c_305,plain,
    ( ssList(app(A,A))
    | ~ ssList(A) ),
    inference(factor,[status(thm)],[c_118]) ).

cnf(c_821,plain,
    ( ~ ssItem(B)
    | ~ ssList(A)
    | ~ ssList(C)
    | ~ ssList(D)
    | ssItem(E)
    | ~ ssList(app(app(A,cons(B,C)),cons(B,D))) ),
    inference(xxres,[status(thm)],[c_44]) ).

cnf(c_822,plain,
    ( ~ ssItem(B)
    | ~ ssList(A)
    | ~ ssList(C)
    | ssItem(D)
    | ~ ssList(app(app(A,cons(B,C)),cons(B,C))) ),
    inference(factor,[status(thm)],[c_821]) ).

cnf(c_825,plain,
    ( ~ ssItem(B)
    | ~ ssList(A)
    | ssItem(C)
    | ~ ssList(app(app(A,cons(B,A)),cons(B,A))) ),
    inference(factor,[status(thm)],[c_822]) ).

cnf(c_1653,plain,
    ( ~ ssItem(A)
    | cons(A,nil) != nil ),
    inference(resolve,[status(thm)],[c_124,c_49]) ).

cnf(c_7074,plain,
    app(nil,sk3) = sk3,
    inference(resolve,[status(thm)],[c_200,c_109]) ).

cnf(c_7379,plain,
    ~ memberP(nil,sk5),
    inference(resolve,[status(thm)],[c_204,c_107]) ).

cnf(c_16671,plain,
    ( memberP(nil,sk5)
    | ssItem(sk6) ),
    inference(paramod,[status(thm)],[c_212,c_206]) ).

cnf(c_7596,plain,
    ssItem(sk6),
    inference(resolve,[status(thm)],[c_7379,c_16671]) ).

cnf(c_16672,plain,
    ( A = sk6
    | memberP(nil,A)
    | ~ ssItem(A)
    | ~ ssItem(sk6)
    | ~ ssList(nil)
    | ~ memberP(sk3,A)
    | sk3 = nil ),
    inference(paramod,[status(thm)],[c_218,c_182]) ).

cnf(c_16673,plain,
    ( sk6 = A
    | memberP(nil,A)
    | ~ ssItem(A)
    | ~ ssItem(sk6)
    | ~ ssList(nil)
    | ~ memberP(sk3,A)
    | sk3 = nil ),
    inference(copy,[status(thm)],[c_16672]) ).

cnf(c_16674,plain,
    ( sk6 = A
    | memberP(nil,A)
    | ~ ssItem(A)
    | ~ ssItem(sk6)
    | ~ memberP(sk3,A)
    | sk3 = nil ),
    inference(resolve,[status(thm)],[c_49,c_16673]) ).

cnf(c_7693,plain,
    ( sk6 = A
    | memberP(nil,A)
    | ~ ssItem(A)
    | ~ memberP(sk3,A)
    | sk3 = nil ),
    inference(resolve,[status(thm)],[c_7596,c_16674]) ).

cnf(c_16675,plain,
    ( memberP(nil,sk5)
    | cons(sk6,nil) = sk3 ),
    inference(paramod,[status(thm)],[c_218,c_206]) ).

cnf(c_7700,plain,
    cons(sk6,nil) = sk3,
    inference(resolve,[status(thm)],[c_7379,c_16675]) ).

cnf(c_16676,plain,
    ( memberP(nil,sk5)
    | memberP(sk4,sk6) ),
    inference(paramod,[status(thm)],[c_220,c_206]) ).

cnf(c_7734,plain,
    memberP(sk4,sk6),
    inference(resolve,[status(thm)],[c_7379,c_16676]) ).

cnf(c_8635,plain,
    ssList(app(sk3,sk3)),
    inference(resolve,[status(thm)],[c_305,c_200]) ).

cnf(c_16677,plain,
    cons(sk6,nil) != nil,
    inference(resolve,[status(thm)],[c_1653,c_7596]) ).

cnf(c_11631,plain,
    sk3 != nil,
    inference(paramod,[status(thm)],[c_7700,c_16677]) ).

cnf(c_11665,plain,
    ( sk6 = A
    | memberP(nil,A)
    | ~ ssItem(A)
    | ~ memberP(sk3,A) ),
    inference(resolve,[status(thm)],[c_11631,c_7693]) ).

cnf(c_16678,plain,
    ( ~ ssItem(sk6)
    | ~ ssList(nil)
    | ssItem(A)
    | ~ ssList(app(app(nil,sk3),cons(sk6,nil))) ),
    inference(paramod,[status(thm)],[c_7700,c_825]) ).

cnf(c_16679,plain,
    ( ~ ssItem(sk6)
    | ~ ssList(nil)
    | ssItem(A)
    | ~ ssList(app(sk3,cons(sk6,nil))) ),
    inference(paramod,[status(thm)],[c_7074,c_16678]) ).

cnf(c_16680,plain,
    ( ~ ssItem(sk6)
    | ~ ssList(nil)
    | ssItem(A)
    | ~ ssList(app(sk3,sk3)) ),
    inference(paramod,[status(thm)],[c_7700,c_16679]) ).

cnf(c_16681,plain,
    ( ~ ssItem(sk6)
    | ~ ssList(nil)
    | ssItem(A) ),
    inference(resolve,[status(thm)],[c_8635,c_16680]) ).

cnf(c_16682,plain,
    ( ~ ssItem(sk6)
    | ssItem(A) ),
    inference(resolve,[status(thm)],[c_49,c_16681]) ).

cnf(c_12553,plain,
    ssItem(A),
    inference(resolve,[status(thm)],[c_7596,c_16682]) ).

cnf(c_12747,plain,
    ( sk6 = A
    | memberP(nil,A)
    | ~ memberP(sk3,A) ),
    inference(resolve,[status(thm)],[c_12553,c_11665]) ).

cnf(c_16337,plain,
    ~ memberP(nil,A),
    inference(resolve,[status(thm)],[c_12553,c_107]) ).

cnf(c_16374,plain,
    ( sk6 = A
    | ~ memberP(sk3,A) ),
    inference(resolve,[status(thm)],[c_16337,c_12747]) ).

cnf(c_16683,plain,
    sk6 = sk5,
    inference(resolve,[status(thm)],[c_16374,c_206]) ).

cnf(c_16642,plain,
    sk5 = sk6,
    inference(copy,[status(thm)],[c_16683]) ).

cnf(c_16684,plain,
    ~ memberP(sk4,sk6),
    inference(paramod,[status(thm)],[c_16642,c_208]) ).

cnf(c_16670,plain,
    $false,
    inference(resolve,[status(thm)],[c_7734,c_16684]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC407-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.11/0.55  % Computer : n018.cluster.edu
% 0.11/0.55  % Model    : x86_64 x86_64
% 0.11/0.55  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.55  % Memory   : 8046.5625MB
% 0.11/0.55  % OS       : Linux 6.8.0-71-generic
% 0.11/0.55  % CPULimit : 300
% 0.11/0.55  % WCLimit  : 300
% 0.11/0.55  % DateTime : Sat Sep 26 13:01:38 UTC 2026
% 0.11/0.56  % CPUTime  : 
% 0.14/0.56  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.56  % Process 517291 was started by sandbox2 on n018,
% 0.14/0.56  % Sat Sep 26 13:01:38 2026
% 0.14/0.56  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.57  
% 0.14/0.57  % From the command line: assign(max_seconds, 300).
% 105.56/14.78  
% 105.56/14.78  % given #500 (I,wt=33): 562 app(A,cons(B,cons(C,A))) != A | -ssList(A) | -ssItem(C) | -ssItem(B) | B = C | skaf79(A) != skaf78(A).  [factor(374,b,e)].
% 105.56/14.78  
% 105.56/14.78  % given #1000 (W,wt=8): 7071 sk3 != nil | segmentP(nil,sk3).  [resolve(200,a,112,b),flip(a)].
% 105.56/14.78  
% 105.56/14.78  % SZS status Unsatisfiable for theBenchmark
% 105.56/14.78  
% 105.56/14.78  % Proof 1 at 4.71 (+ 1.33) seconds.
% 105.56/14.78  % Length of proof is 44.
% 105.56/14.78  % Level of proof is 10.
% 105.56/14.78  % Maximum clause weight is 33.000.
% 105.56/14.78  % Given clauses 1319.
% 105.56/14.78  
% 105.56/14.78  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------