TSTP Solution File: SWC218-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWC218-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 03:11:38 EDT 2024

% Result   : Unsatisfiable 7.81s 1.69s
% Output   : CNFRefutation 7.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   49 (  16 unt;   1 nHn;  49 RR)
%            Number of literals    :  125 (  54 equ;  78 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

cnf(c_54,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

cnf(c_55,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

cnf(c_56,negated_conjecture,
    ssList(sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

cnf(c_58,negated_conjecture,
    ssItem(sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

cnf(c_59,negated_conjecture,
    app(app(sk5,cons(sk7,nil)),sk6) = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

cnf(c_60,negated_conjecture,
    ~ neq(sk1,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

cnf(c_68,plain,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).

cnf(c_134,plain,
    ( ~ ssList(X0)
    | app(nil,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).

cnf(c_145,plain,
    ( ~ ssList(X0)
    | ~ ssList(X1)
    | ssList(app(X1,X0)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).

cnf(c_146,plain,
    ( ~ ssList(X0)
    | ~ ssItem(X1)
    | ssList(cons(X1,X0)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).

cnf(c_159,plain,
    ( cons(X0,X1) != X1
    | ~ ssList(X1)
    | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).

cnf(c_160,plain,
    ( ~ ssList(X0)
    | ~ ssList(X1)
    | X0 = X1
    | neq(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).

cnf(c_178,plain,
    ( app(X0,X1) != nil
    | ~ ssList(X0)
    | ~ ssList(X1)
    | X0 = nil ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).

cnf(c_179,plain,
    ( app(X0,X1) != nil
    | ~ ssList(X0)
    | ~ ssList(X1)
    | X1 = nil ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).

cnf(c_180,plain,
    ( ~ ssList(X0)
    | ~ ssItem(X1)
    | app(cons(X1,nil),X0) = cons(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).

cnf(c_211,plain,
    ( app(X0,X1) != app(X2,X1)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | X0 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause151) ).

cnf(c_1645,plain,
    app(app(sk5,cons(sk7,nil)),sk6) = sk1,
    inference(light_normalisation,[status(thm)],[c_59,c_54]) ).

cnf(c_2566,plain,
    ( X0 != sk1
    | X1 != nil
    | ~ ssList(X0)
    | ~ ssList(X1)
    | X0 = X1 ),
    inference(resolution_lifted,[status(thm)],[c_60,c_160]) ).

cnf(c_2567,plain,
    ( ~ ssList(sk1)
    | ~ ssList(nil)
    | sk1 = nil ),
    inference(unflattening,[status(thm)],[c_2566]) ).

cnf(c_2568,plain,
    sk1 = nil,
    inference(global_subsumption_just,[status(thm)],[c_2567,c_49,c_68,c_2567]) ).

cnf(c_4593,plain,
    ( ~ ssList(X0)
    | app(sk1,X0) = X0 ),
    inference(light_normalisation,[status(thm)],[c_134,c_2568]) ).

cnf(c_4603,plain,
    app(app(sk5,cons(sk7,sk1)),sk6) = sk1,
    inference(light_normalisation,[status(thm)],[c_1645,c_2568]) ).

cnf(c_4832,plain,
    ( ~ ssList(X0)
    | ~ ssItem(X1)
    | app(cons(X1,sk1),X0) = cons(X1,X0) ),
    inference(light_normalisation,[status(thm)],[c_180,c_2568]) ).

cnf(c_4871,plain,
    ( app(X0,X1) != sk1
    | ~ ssList(X0)
    | ~ ssList(X1)
    | X1 = sk1 ),
    inference(light_normalisation,[status(thm)],[c_179,c_2568]) ).

cnf(c_4880,plain,
    ( app(X0,X1) != sk1
    | ~ ssList(X0)
    | ~ ssList(X1)
    | X0 = sk1 ),
    inference(light_normalisation,[status(thm)],[c_178,c_2568]) ).

cnf(c_11876,plain,
    app(sk1,sk6) = sk6,
    inference(superposition,[status(thm)],[c_56,c_4593]) ).

cnf(c_11921,plain,
    ( ~ ssItem(X0)
    | app(cons(X0,sk1),sk6) = cons(X0,sk6) ),
    inference(superposition,[status(thm)],[c_56,c_4832]) ).

cnf(c_11940,plain,
    ( ~ ssList(app(sk5,cons(sk7,sk1)))
    | ~ ssList(sk6)
    | app(sk5,cons(sk7,sk1)) = sk1 ),
    inference(superposition,[status(thm)],[c_4603,c_4880]) ).

cnf(c_12021,plain,
    ( app(X0,sk6) != sk1
    | ~ ssList(app(sk5,cons(sk7,sk1)))
    | ~ ssList(X0)
    | ~ ssList(sk6)
    | app(sk5,cons(sk7,sk1)) = X0 ),
    inference(superposition,[status(thm)],[c_4603,c_211]) ).

cnf(c_12124,plain,
    ( app(X0,sk6) != sk6
    | ~ ssList(X0)
    | ~ ssList(sk1)
    | ~ ssList(sk6)
    | X0 = sk1 ),
    inference(superposition,[status(thm)],[c_11876,c_211]) ).

cnf(c_12280,plain,
    app(cons(sk7,sk1),sk6) = cons(sk7,sk6),
    inference(superposition,[status(thm)],[c_58,c_11921]) ).

cnf(c_12373,plain,
    ( ~ ssList(app(sk5,cons(sk7,sk1)))
    | app(sk5,cons(sk7,sk1)) = sk1 ),
    inference(global_subsumption_just,[status(thm)],[c_11940,c_56,c_11940]) ).

cnf(c_12379,plain,
    ( ~ ssList(cons(sk7,sk1))
    | ~ ssList(sk5)
    | app(sk5,cons(sk7,sk1)) = sk1 ),
    inference(superposition,[status(thm)],[c_145,c_12373]) ).

cnf(c_12783,plain,
    ( ~ ssList(X0)
    | ~ ssList(app(sk5,cons(sk7,sk1)))
    | app(X0,sk6) != sk1
    | app(sk5,cons(sk7,sk1)) = X0 ),
    inference(global_subsumption_just,[status(thm)],[c_12021,c_56,c_12021]) ).

cnf(c_12784,plain,
    ( app(X0,sk6) != sk1
    | ~ ssList(app(sk5,cons(sk7,sk1)))
    | ~ ssList(X0)
    | app(sk5,cons(sk7,sk1)) = X0 ),
    inference(renaming,[status(thm)],[c_12783]) ).

cnf(c_12796,plain,
    ( sk1 != sk6
    | ~ ssList(app(sk5,cons(sk7,sk1)))
    | ~ ssList(sk1)
    | app(sk5,cons(sk7,sk1)) = sk1 ),
    inference(superposition,[status(thm)],[c_11876,c_12784]) ).

cnf(c_12937,plain,
    ( app(X0,sk6) != sk6
    | ~ ssList(X0)
    | X0 = sk1 ),
    inference(global_subsumption_just,[status(thm)],[c_12124,c_56,c_49,c_12124]) ).

cnf(c_13435,plain,
    ( cons(sk7,sk6) != sk1
    | ~ ssList(cons(sk7,sk1))
    | ~ ssList(sk6)
    | cons(sk7,sk1) = sk1 ),
    inference(superposition,[status(thm)],[c_12280,c_4880]) ).

cnf(c_13438,plain,
    ( cons(sk7,sk6) != sk6
    | ~ ssList(cons(sk7,sk1))
    | cons(sk7,sk1) = sk1 ),
    inference(superposition,[status(thm)],[c_12280,c_12937]) ).

cnf(c_13772,plain,
    ( ~ ssList(cons(sk7,sk1))
    | app(sk5,cons(sk7,sk1)) = sk1 ),
    inference(global_subsumption_just,[status(thm)],[c_12379,c_55,c_12379]) ).

cnf(c_13778,plain,
    ( ~ ssList(sk1)
    | ~ ssItem(sk7)
    | app(sk5,cons(sk7,sk1)) = sk1 ),
    inference(superposition,[status(thm)],[c_146,c_13772]) ).

cnf(c_15387,plain,
    app(sk5,cons(sk7,sk1)) = sk1,
    inference(global_subsumption_just,[status(thm)],[c_12796,c_58,c_49,c_13778]) ).

cnf(c_15392,plain,
    ( ~ ssList(cons(sk7,sk1))
    | ~ ssList(sk5)
    | cons(sk7,sk1) = sk1 ),
    inference(superposition,[status(thm)],[c_15387,c_4871]) ).

cnf(c_17305,plain,
    ( ~ ssList(cons(sk7,sk1))
    | cons(sk7,sk1) = sk1 ),
    inference(global_subsumption_just,[status(thm)],[c_13438,c_55,c_15392]) ).

cnf(c_17311,plain,
    ( ~ ssList(sk1)
    | ~ ssItem(sk7)
    | cons(sk7,sk1) = sk1 ),
    inference(superposition,[status(thm)],[c_146,c_17305]) ).

cnf(c_17314,plain,
    cons(sk7,sk1) = sk1,
    inference(global_subsumption_just,[status(thm)],[c_13435,c_58,c_49,c_17311]) ).

cnf(c_17318,plain,
    ( ~ ssList(sk1)
    | ~ ssItem(sk7) ),
    inference(superposition,[status(thm)],[c_17314,c_159]) ).

cnf(c_17331,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_17318,c_49,c_58]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC218-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu May  2 23:20:20 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.81/1.69  % SZS status Started for theBenchmark.p
% 7.81/1.69  % SZS status Unsatisfiable for theBenchmark.p
% 7.81/1.69  
% 7.81/1.69  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.81/1.69  
% 7.81/1.69  ------  iProver source info
% 7.81/1.69  
% 7.81/1.69  git: date: 2024-05-02 19:28:25 +0000
% 7.81/1.69  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.81/1.69  git: non_committed_changes: false
% 7.81/1.69  
% 7.81/1.69  ------ Parsing...successful
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  ------ Preprocessing... sup_sim: 6  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 50  sf_s  rm: 2 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e 
% 7.81/1.69  
% 7.81/1.69  ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.81/1.69  
% 7.81/1.69  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 7.81/1.69  ------ Proving...
% 7.81/1.69  ------ Problem Properties 
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  clauses                                 186
% 7.81/1.69  conjectures                             7
% 7.81/1.69  EPR                                     59
% 7.81/1.69  Horn                                    158
% 7.81/1.69  unary                                   67
% 7.81/1.69  binary                                  21
% 7.81/1.69  lits                                    550
% 7.81/1.69  lits eq                                 74
% 7.81/1.69  fd_pure                                 0
% 7.81/1.69  fd_pseudo                               0
% 7.81/1.69  fd_cond                                 15
% 7.81/1.69  fd_pseudo_cond                          14
% 7.81/1.69  AC symbols                              0
% 7.81/1.69  
% 7.81/1.69  ------ Input Options Time Limit: Unbounded
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  ------ 
% 7.81/1.69  Current options:
% 7.81/1.69  ------ 
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  ------ Proving...
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  ------ Proving...
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  ------ Proving...
% 7.81/1.69  
% 7.81/1.69  
% 7.81/1.69  % SZS status Unsatisfiable for theBenchmark.p
% 7.81/1.69  
% 7.81/1.69  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.81/1.69  
% 7.81/1.70  
%------------------------------------------------------------------------------