↑ Up

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

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

% Result   : Unsatisfiable 52.47s 8.08s
% Output   : CNFRefutation 52.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   40 (  13 unt;   0 def)
%            Number of atoms       :   91 (  26 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  110 (  59   ~;  51   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1_21,axiom,
    ( ~ neq(sk4,nil)
    | app(sk6,sk7) = sk3 ),
    file('theBenchmark.p',co1_21) ).

cnf(c_52,plain,
    ( ~ neq(sk4,nil)
    | app(sk6,sk7) = sk3 ),
    inference(clausify,[status(thm)],[co1_21]) ).

fof(co1_20,axiom,
    ( ~ neq(sk4,nil)
    | app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
    file('theBenchmark.p',co1_20) ).

cnf(c_53,plain,
    ( ~ neq(sk4,nil)
    | app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
    inference(clausify,[status(thm)],[co1_20]) ).

fof(co1_19,axiom,
    ( ~ neq(sk4,nil)
    | ssList(sk7) ),
    file('theBenchmark.p',co1_19) ).

cnf(c_54,plain,
    ( ~ neq(sk4,nil)
    | ssList(sk7) ),
    inference(clausify,[status(thm)],[co1_19]) ).

fof(co1_18,axiom,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ),
    file('theBenchmark.p',co1_18) ).

cnf(c_55,plain,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ),
    inference(clausify,[status(thm)],[co1_18]) ).

fof(co1_17,axiom,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    file('theBenchmark.p',co1_17) ).

cnf(c_56,plain,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    inference(clausify,[status(thm)],[co1_17]) ).

fof(co1_16,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ neq(sk4,nil)
      | app(VAR_1,VAR_2) != sk1
      | app(app(VAR_1,cons(VAR_0,nil)),VAR_2) != sk2
      | ~ ssList(VAR_2)
      | ~ ssList(VAR_1)
      | ~ ssItem(VAR_0) ),
    file('theBenchmark.p',co1_16) ).

cnf(c_57,plain,
    ( ~ neq(sk4,nil)
    | app(B,C) != sk1
    | app(app(B,cons(A,nil)),C) != sk2
    | ~ ssList(C)
    | ~ ssList(B)
    | ~ ssItem(A) ),
    inference(clausify,[status(thm)],[co1_16]) ).

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

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

cnf(c_67,plain,
    neq(sk2,nil),
    inference(copy,[status(thm)],[c_66]) ).

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

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

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

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

cnf(c_70,plain,
    sk4 = sk2,
    inference(copy,[status(thm)],[c_69]) ).

cnf(c_22132,plain,
    ( ~ neq(sk4,nil)
    | app(B,C) != sk3
    | app(app(B,cons(A,nil)),C) != sk2
    | ~ ssList(C)
    | ~ ssList(B)
    | ~ ssItem(A) ),
    inference(paramod,[status(thm)],[c_68,c_57]) ).

cnf(c_22133,plain,
    ( ~ neq(sk2,nil)
    | app(B,C) != sk3
    | app(app(B,cons(A,nil)),C) != sk2
    | ~ ssList(C)
    | ~ ssList(B)
    | ~ ssItem(A) ),
    inference(paramod,[status(thm)],[c_70,c_22132]) ).

cnf(c_332,plain,
    ( app(B,C) != sk3
    | app(app(B,cons(A,nil)),C) != sk2
    | ~ ssList(C)
    | ~ ssList(B)
    | ~ ssItem(A) ),
    inference(resolve,[status(thm)],[c_67,c_22133]) ).

cnf(c_22134,plain,
    ( ~ neq(sk2,nil)
    | ssItem(sk5) ),
    inference(paramod,[status(thm)],[c_70,c_56]) ).

cnf(c_333,plain,
    ssItem(sk5),
    inference(resolve,[status(thm)],[c_67,c_22134]) ).

cnf(c_22135,plain,
    ( ~ neq(sk2,nil)
    | ssList(sk6) ),
    inference(paramod,[status(thm)],[c_70,c_55]) ).

cnf(c_334,plain,
    ssList(sk6),
    inference(resolve,[status(thm)],[c_67,c_22135]) ).

cnf(c_22136,plain,
    ( ~ neq(sk2,nil)
    | ssList(sk7) ),
    inference(paramod,[status(thm)],[c_70,c_54]) ).

cnf(c_335,plain,
    ssList(sk7),
    inference(resolve,[status(thm)],[c_67,c_22136]) ).

cnf(c_22137,plain,
    ( ~ neq(sk4,nil)
    | app(app(sk6,cons(sk5,nil)),sk7) = sk2 ),
    inference(paramod,[status(thm)],[c_70,c_53]) ).

cnf(c_22138,plain,
    ( ~ neq(sk2,nil)
    | app(app(sk6,cons(sk5,nil)),sk7) = sk2 ),
    inference(paramod,[status(thm)],[c_70,c_22137]) ).

cnf(c_336,plain,
    app(app(sk6,cons(sk5,nil)),sk7) = sk2,
    inference(resolve,[status(thm)],[c_67,c_22138]) ).

cnf(c_22139,plain,
    ( ~ neq(sk2,nil)
    | app(sk6,sk7) = sk3 ),
    inference(paramod,[status(thm)],[c_70,c_52]) ).

cnf(c_337,plain,
    app(sk6,sk7) = sk3,
    inference(resolve,[status(thm)],[c_67,c_22139]) ).

cnf(c_22140,plain,
    ( app(sk6,sk7) != sk3
    | ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(resolve,[status(thm)],[c_336,c_332]) ).

cnf(c_22141,plain,
    ( sk3 != sk3
    | ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(paramod,[status(thm)],[c_337,c_22140]) ).

cnf(c_22142,plain,
    ( ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(copy,[status(thm)],[c_22141]) ).

cnf(c_22143,plain,
    ( ~ ssList(sk7)
    | ~ ssList(sk6) ),
    inference(resolve,[status(thm)],[c_333,c_22142]) ).

cnf(c_22144,plain,
    ~ ssList(sk7),
    inference(resolve,[status(thm)],[c_334,c_22143]) ).

cnf(c_22131,plain,
    $false,
    inference(resolve,[status(thm)],[c_335,c_22144]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC010-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.41  % Computer : n020.cluster.edu
% 0.16/0.41  % Model    : x86_64 x86_64
% 0.16/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41  % Memory   : 8046.5625MB
% 0.16/0.41  % OS       : Linux 6.8.0-71-generic
% 0.16/0.41  % CPULimit : 300
% 0.16/0.41  % WCLimit  : 300
% 0.16/0.41  % DateTime : Sat Sep 26 12:04:19 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.42  % Process 1487185 was started by sandbox on n020,
% 0.16/0.42  % Sat Sep 26 12:04:19 2026
% 0.16/0.42  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/0.43  
% 0.16/0.43  % From the command line: assign(max_seconds, 300).
% 52.47/8.08  
% 52.47/8.08  % SZS status Unsatisfiable for theBenchmark
% 52.47/8.08  
% 52.47/8.08  % Proof 1 at 6.70 (+ 0.82) seconds.
% 52.47/8.08  % Length of proof is 18.
% 52.47/8.08  % Level of proof is 3.
% 52.47/8.08  % Maximum clause weight is 45.000.
% 52.47/8.08  % Given clauses 270.
% 52.47/8.08  
% 52.47/8.08  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------