TSTP Solution File: SWC231-1 by iProver---3.8

View Problem - Process Solution

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

% Computer : n016.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 : Thu Aug 31 20:41:51 EDT 2023

% Result   : Unsatisfiable 159.01s 21.81s
% Output   : CNFRefutation 159.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   20
% Syntax   : Number of clauses     :   76 (  24 unt;  11 nHn;  56 RR)
%            Number of literals    :  174 (  45 equ;  98 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   3 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-3 aty)
%            Number of variables   :   90 (  18 sgn)

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

cnf(c_50,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).

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

cnf(c_55,negated_conjecture,
    sk1 != nil,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

cnf(c_57,negated_conjecture,
    ( app(app(X0,cons(X1,nil)),X2) != sk1
    | ~ ssList(X0)
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | memberP(X0,sk5(X2,X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

cnf(c_61,negated_conjecture,
    ( sk3 = nil
    | ssItem(sk6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

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

cnf(c_77,plain,
    ssItem(skaf83(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).

cnf(c_78,plain,
    ssList(skaf82(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).

cnf(c_136,plain,
    ( ~ memberP(nil,X0)
    | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).

cnf(c_137,plain,
    ( ~ ssList(X0)
    | ssItem(X1)
    | duplicatefreeP(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).

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

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

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

cnf(c_161,plain,
    ( ~ ssList(X0)
    | ~ ssItem(X1)
    | tl(cons(X1,X0)) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).

cnf(c_162,plain,
    ( ~ ssList(X0)
    | ~ ssItem(X1)
    | hd(cons(X1,X0)) = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).

cnf(c_169,plain,
    ( ~ ssList(X0)
    | cons(hd(X0),tl(X0)) = X0
    | X0 = nil ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).

cnf(c_174,plain,
    ( ~ ssList(X0)
    | cons(skaf83(X0),skaf82(X0)) = X0
    | X0 = nil ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).

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

cnf(c_244,plain,
    ( app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4
    | ~ ssList(X0)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ duplicatefreeP(X4) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).

cnf(c_267,plain,
    ( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
    | ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
    | ~ ssList(X0)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssItem(X1) ),
    inference(unflattening,[status(thm)],[c_244]) ).

cnf(c_1632,plain,
    ( sk1 = nil
    | ssItem(sk6) ),
    inference(light_normalisation,[status(thm)],[c_61,c_54]) ).

cnf(c_1633,plain,
    ssItem(sk6),
    inference(forward_subsumption_resolution,[status(thm)],[c_1632,c_55]) ).

cnf(c_6550,plain,
    ( ssItem(X0)
    | ~ sP0_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_137]) ).

cnf(c_6551,plain,
    ( duplicatefreeP(X0)
    | ~ ssList(X0)
    | ~ sP1_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_137]) ).

cnf(c_6552,plain,
    ( sP0_iProver_split
    | sP1_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_137]) ).

cnf(c_10307,plain,
    ( ~ ssItem(X0)
    | hd(cons(X0,skaf82(X1))) = X0 ),
    inference(superposition,[status(thm)],[c_78,c_162]) ).

cnf(c_11131,plain,
    ( cons(skaf83(sk2),skaf82(sk2)) = sk2
    | sk2 = nil ),
    inference(superposition,[status(thm)],[c_50,c_174]) ).

cnf(c_11313,plain,
    ( ~ ssItem(X0)
    | app(cons(X0,nil),sk1) = cons(X0,sk1) ),
    inference(superposition,[status(thm)],[c_49,c_185]) ).

cnf(c_11622,plain,
    app(cons(skaf83(X0),nil),sk1) = cons(skaf83(X0),sk1),
    inference(superposition,[status(thm)],[c_77,c_11313]) ).

cnf(c_15014,plain,
    ( ~ ssList(app(app(X0,cons(sk6,X1)),cons(sk6,X2)))
    | ~ duplicatefreeP(app(app(X0,cons(sk6,X1)),cons(sk6,X2)))
    | ~ ssList(X0)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssItem(sk6) ),
    inference(instantiation,[status(thm)],[c_267]) ).

cnf(c_15015,plain,
    ( ~ ssList(app(app(nil,cons(sk6,nil)),cons(sk6,nil)))
    | ~ duplicatefreeP(app(app(nil,cons(sk6,nil)),cons(sk6,nil)))
    | ~ ssList(nil)
    | ~ ssItem(sk6) ),
    inference(instantiation,[status(thm)],[c_15014]) ).

cnf(c_27033,plain,
    ( ~ ssList(cons(sk6,X0))
    | ~ ssList(X1)
    | ssList(app(X1,cons(sk6,X0))) ),
    inference(instantiation,[status(thm)],[c_150]) ).

cnf(c_27034,plain,
    ( ~ ssList(cons(sk6,nil))
    | ~ ssList(nil)
    | ssList(app(nil,cons(sk6,nil))) ),
    inference(instantiation,[status(thm)],[c_27033]) ).

cnf(c_32848,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sk6)
    | ssList(cons(sk6,nil)) ),
    inference(instantiation,[status(thm)],[c_151]) ).

cnf(c_61601,plain,
    ( ~ ssItem(skaf83(X0))
    | ~ ssList(nil)
    | ssList(cons(skaf83(X0),nil)) ),
    inference(instantiation,[status(thm)],[c_151]) ).

cnf(c_74642,plain,
    hd(cons(skaf83(X0),skaf82(X1))) = skaf83(X0),
    inference(superposition,[status(thm)],[c_77,c_10307]) ).

cnf(c_75242,plain,
    ( skaf83(sk2) = hd(sk2)
    | sk2 = nil ),
    inference(superposition,[status(thm)],[c_11131,c_74642]) ).

cnf(c_91613,plain,
    ( ~ ssList(cons(skaf83(X0),nil))
    | ~ ssList(sk1)
    | ssList(cons(skaf83(X0),sk1)) ),
    inference(superposition,[status(thm)],[c_11622,c_150]) ).

cnf(c_91641,plain,
    ( ~ ssList(cons(skaf83(X0),nil))
    | ssList(cons(skaf83(X0),sk1)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_91613,c_49]) ).

cnf(c_92000,plain,
    ssList(cons(skaf83(X0),sk1)),
    inference(global_subsumption_just,[status(thm)],[c_91641,c_73,c_77,c_61601,c_91641]) ).

cnf(c_92035,plain,
    ( ~ sP1_iProver_split
    | duplicatefreeP(cons(skaf83(X0),sk1)) ),
    inference(superposition,[status(thm)],[c_92000,c_6551]) ).

cnf(c_94999,plain,
    ( ~ sP1_iProver_split
    | sk2 = nil
    | duplicatefreeP(cons(hd(sk2),sk1)) ),
    inference(superposition,[status(thm)],[c_75242,c_92035]) ).

cnf(c_164193,plain,
    ( ~ ssList(cons(X0,nil))
    | ~ ssList(X1)
    | ssList(app(X1,cons(X0,nil))) ),
    inference(instantiation,[status(thm)],[c_150]) ).

cnf(c_178984,plain,
    ( ~ ssList(app(X0,cons(sk6,X1)))
    | ~ ssList(cons(sk6,nil))
    | ssList(app(app(X0,cons(sk6,X1)),cons(sk6,nil))) ),
    inference(instantiation,[status(thm)],[c_164193]) ).

cnf(c_178989,plain,
    ( ~ ssList(app(nil,cons(sk6,nil)))
    | ~ ssList(cons(sk6,nil))
    | ssList(app(app(nil,cons(sk6,nil)),cons(sk6,nil))) ),
    inference(instantiation,[status(thm)],[c_178984]) ).

cnf(c_184405,plain,
    ( ~ ssList(app(app(X0,cons(sk6,X1)),cons(sk6,X2)))
    | ~ sP1_iProver_split
    | duplicatefreeP(app(app(X0,cons(sk6,X1)),cons(sk6,X2))) ),
    inference(instantiation,[status(thm)],[c_6551]) ).

cnf(c_184406,plain,
    ( ~ ssList(app(app(nil,cons(sk6,nil)),cons(sk6,nil)))
    | ~ sP1_iProver_split
    | duplicatefreeP(app(app(nil,cons(sk6,nil)),cons(sk6,nil))) ),
    inference(instantiation,[status(thm)],[c_184405]) ).

cnf(c_214591,plain,
    ~ sP1_iProver_split,
    inference(global_subsumption_just,[status(thm)],[c_94999,c_73,c_1633,c_15015,c_27034,c_32848,c_178989,c_184406]) ).

cnf(c_214593,plain,
    sP0_iProver_split,
    inference(backward_subsumption_resolution,[status(thm)],[c_6552,c_214591]) ).

cnf(c_214599,plain,
    ssItem(X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_6550,c_214593]) ).

cnf(c_214890,plain,
    ( ~ ssList(X0)
    | app(cons(X1,nil),X0) = cons(X1,X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_185,c_214599]) ).

cnf(c_214901,plain,
    ( ~ ssList(X0)
    | tl(cons(X1,X0)) = X0 ),
    inference(backward_subsumption_resolution,[status(thm)],[c_161,c_214599]) ).

cnf(c_214902,plain,
    ( ~ ssList(X0)
    | ssList(cons(X1,X0)) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_151,c_214599]) ).

cnf(c_214917,plain,
    ( app(app(X0,cons(X1,nil)),X2) != sk1
    | ~ ssList(X0)
    | ~ ssList(X2)
    | memberP(X0,sk5(X2,X0,X1)) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_57,c_214599]) ).

cnf(c_293920,plain,
    ( ~ ssList(X2)
    | ~ ssList(X0)
    | app(app(X0,cons(X1,nil)),X2) != sk1
    | memberP(X0,sk5(X2,X0,X1)) ),
    inference(global_subsumption_just,[status(thm)],[c_57,c_214917]) ).

cnf(c_293921,negated_conjecture,
    ( app(app(X0,cons(X1,nil)),X2) != sk1
    | ~ ssList(X0)
    | ~ ssList(X2)
    | memberP(X0,sk5(X2,X0,X1)) ),
    inference(renaming,[status(thm)],[c_293920]) ).

cnf(c_294084,plain,
    ~ memberP(nil,X0),
    inference(global_subsumption_just,[status(thm)],[c_136,c_73,c_136,c_1633,c_6550,c_6552,c_15015,c_27034,c_32848,c_178989,c_184406]) ).

cnf(c_294235,plain,
    ( ~ ssList(X0)
    | ssList(cons(X1,X0)) ),
    inference(global_subsumption_just,[status(thm)],[c_151,c_214902]) ).

cnf(c_294241,plain,
    ( ~ ssList(X0)
    | app(nil,cons(X1,X0)) = cons(X1,X0) ),
    inference(superposition,[status(thm)],[c_294235,c_139]) ).

cnf(c_294813,plain,
    ( ~ ssList(X0)
    | tl(cons(X1,X0)) = X0 ),
    inference(global_subsumption_just,[status(thm)],[c_161,c_214901]) ).

cnf(c_294824,plain,
    tl(cons(X0,skaf82(X1))) = skaf82(X1),
    inference(superposition,[status(thm)],[c_78,c_294813]) ).

cnf(c_295086,plain,
    ( cons(hd(sk1),tl(sk1)) = sk1
    | sk1 = nil ),
    inference(superposition,[status(thm)],[c_49,c_169]) ).

cnf(c_295127,plain,
    cons(hd(sk1),tl(sk1)) = sk1,
    inference(forward_subsumption_resolution,[status(thm)],[c_295086,c_55]) ).

cnf(c_295249,plain,
    ( cons(skaf83(sk1),skaf82(sk1)) = sk1
    | sk1 = nil ),
    inference(superposition,[status(thm)],[c_49,c_174]) ).

cnf(c_295290,plain,
    cons(skaf83(sk1),skaf82(sk1)) = sk1,
    inference(forward_subsumption_resolution,[status(thm)],[c_295249,c_55]) ).

cnf(c_295356,plain,
    ( ~ ssList(X0)
    | app(cons(X1,nil),X0) = cons(X1,X0) ),
    inference(global_subsumption_just,[status(thm)],[c_185,c_214890]) ).

cnf(c_295793,plain,
    skaf82(sk1) = tl(sk1),
    inference(superposition,[status(thm)],[c_295290,c_294824]) ).

cnf(c_312733,plain,
    ssList(tl(sk1)),
    inference(superposition,[status(thm)],[c_295793,c_78]) ).

cnf(c_312762,plain,
    app(cons(X0,nil),tl(sk1)) = cons(X0,tl(sk1)),
    inference(superposition,[status(thm)],[c_312733,c_295356]) ).

cnf(c_566927,plain,
    app(nil,cons(X0,nil)) = cons(X0,nil),
    inference(superposition,[status(thm)],[c_73,c_294241]) ).

cnf(c_567612,plain,
    ( app(cons(X0,nil),X1) != sk1
    | ~ ssList(X1)
    | ~ ssList(nil)
    | memberP(nil,sk5(X1,nil,X0)) ),
    inference(superposition,[status(thm)],[c_566927,c_293921]) ).

cnf(c_567653,plain,
    ( app(cons(X0,nil),X1) != sk1
    | ~ ssList(X1) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_567612,c_294084,c_73]) ).

cnf(c_575766,plain,
    ( cons(X0,tl(sk1)) != sk1
    | ~ ssList(tl(sk1)) ),
    inference(superposition,[status(thm)],[c_312762,c_567653]) ).

cnf(c_575780,plain,
    cons(X0,tl(sk1)) != sk1,
    inference(forward_subsumption_resolution,[status(thm)],[c_575766,c_312733]) ).

cnf(c_575815,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_295127,c_575780]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC231-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.20/0.35  % CPULimit : 300
% 0.20/0.35  % WCLimit  : 300
% 0.20/0.35  % DateTime : Mon Aug 28 19:12:45 EDT 2023
% 0.20/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 159.01/21.81  % SZS status Started for theBenchmark.p
% 159.01/21.81  % SZS status Unsatisfiable for theBenchmark.p
% 159.01/21.81  
% 159.01/21.81  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 159.01/21.81  
% 159.01/21.81  ------  iProver source info
% 159.01/21.81  
% 159.01/21.81  git: date: 2023-05-31 18:12:56 +0000
% 159.01/21.81  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 159.01/21.81  git: non_committed_changes: false
% 159.01/21.81  git: last_make_outside_of_git: false
% 159.01/21.81  
% 159.01/21.81  ------ Parsing...successful
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  ------ Preprocessing... sup_sim: 9  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 159.01/21.81  
% 159.01/21.81  ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 159.01/21.81  
% 159.01/21.81  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 159.01/21.81  ------ Proving...
% 159.01/21.81  ------ Problem Properties 
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  clauses                                 192
% 159.01/21.81  conjectures                             10
% 159.01/21.81  EPR                                     61
% 159.01/21.81  Horn                                    164
% 159.01/21.81  unary                                   67
% 159.01/21.81  binary                                  21
% 159.01/21.81  lits                                    580
% 159.01/21.81  lits eq                                 78
% 159.01/21.81  fd_pure                                 0
% 159.01/21.81  fd_pseudo                               0
% 159.01/21.81  fd_cond                                 15
% 159.01/21.81  fd_pseudo_cond                          14
% 159.01/21.81  AC symbols                              0
% 159.01/21.81  
% 159.01/21.81  ------ Schedule dynamic 5 is on 
% 159.01/21.81  
% 159.01/21.81  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  ------ 
% 159.01/21.81  Current options:
% 159.01/21.81  ------ 
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  ------ Proving...
% 159.01/21.81  Proof_search_loop: time out after: 12182 full_loop iterations
% 159.01/21.81  
% 159.01/21.81  ------ Input Options"--res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  ------ 
% 159.01/21.81  Current options:
% 159.01/21.81  ------ 
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  ------ Proving...
% 159.01/21.81  
% 159.01/21.81  
% 159.01/21.81  % SZS status Unsatisfiable for theBenchmark.p
% 159.01/21.81  
% 159.01/21.81  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 159.01/21.81  
% 159.01/21.82  
%------------------------------------------------------------------------------