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

View Problem - Process Solution

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

% Computer : n019.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:12:25 EDT 2024

% Result   : Unsatisfiable 10.17s 2.20s
% Output   : CNFRefutation 10.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   33 (  13 unt;   0 nHn;  33 RR)
%            Number of literals    :   75 (  28 equ;  48 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn)

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

cnf(c_53,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

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

cnf(c_55,negated_conjecture,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

cnf(c_62,negated_conjecture,
    ( app(app(X0,cons(X1,nil)),X2) != sk2
    | app(app(X2,cons(X1,nil)),X0) != sk1
    | ~ neq(sk4,nil)
    | ~ ssList(X0)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

cnf(c_63,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

cnf(c_64,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).

cnf(c_65,negated_conjecture,
    ( ~ neq(sk4,nil)
    | app(cons(sk5,nil),sk6) = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

cnf(c_66,negated_conjecture,
    ( ~ neq(sk4,nil)
    | app(sk6,cons(sk5,nil)) = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

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

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

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

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

cnf(c_409,negated_conjecture,
    neq(sk2,nil),
    inference(global_subsumption_just,[status(thm)],[c_57,c_55]) ).

cnf(c_1587,plain,
    ( ~ neq(sk2,nil)
    | ssList(sk6) ),
    inference(light_normalisation,[status(thm)],[c_64,c_53]) ).

cnf(c_1588,plain,
    ssList(sk6),
    inference(forward_subsumption_resolution,[status(thm)],[c_1587,c_409]) ).

cnf(c_1589,plain,
    ( ~ neq(sk2,nil)
    | ssItem(sk5) ),
    inference(light_normalisation,[status(thm)],[c_63,c_53]) ).

cnf(c_1590,plain,
    ssItem(sk5),
    inference(forward_subsumption_resolution,[status(thm)],[c_1589,c_409]) ).

cnf(c_1769,plain,
    ( ~ neq(sk2,nil)
    | app(sk6,cons(sk5,nil)) = sk1 ),
    inference(light_normalisation,[status(thm)],[c_66,c_53,c_54]) ).

cnf(c_1770,plain,
    app(sk6,cons(sk5,nil)) = sk1,
    inference(forward_subsumption_resolution,[status(thm)],[c_1769,c_409]) ).

cnf(c_1771,plain,
    ( ~ neq(sk2,nil)
    | app(cons(sk5,nil),sk6) = sk2 ),
    inference(light_normalisation,[status(thm)],[c_65,c_53]) ).

cnf(c_1772,plain,
    app(cons(sk5,nil),sk6) = sk2,
    inference(forward_subsumption_resolution,[status(thm)],[c_1771,c_409]) ).

cnf(c_2459,plain,
    ( app(app(X0,cons(X1,nil)),X2) != sk2
    | app(app(X2,cons(X1,nil)),X0) != sk1
    | ~ neq(sk2,nil)
    | ~ ssList(X0)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(light_normalisation,[status(thm)],[c_62,c_53]) ).

cnf(c_2460,plain,
    ( app(app(X0,cons(X1,nil)),X2) != sk2
    | app(app(X2,cons(X1,nil)),X0) != sk1
    | ~ ssList(X0)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_2459,c_409]) ).

cnf(c_9017,plain,
    app(sk1,nil) = sk1,
    inference(superposition,[status(thm)],[c_49,c_139]) ).

cnf(c_9028,plain,
    ( ~ ssList(X0)
    | ~ ssItem(X1)
    | app(nil,cons(X1,X0)) = cons(X1,X0) ),
    inference(superposition,[status(thm)],[c_152,c_140]) ).

cnf(c_9319,plain,
    ( ~ ssItem(X0)
    | app(nil,cons(X0,nil)) = cons(X0,nil) ),
    inference(superposition,[status(thm)],[c_74,c_9028]) ).

cnf(c_10141,plain,
    app(nil,cons(sk5,nil)) = cons(sk5,nil),
    inference(superposition,[status(thm)],[c_1590,c_9319]) ).

cnf(c_12459,plain,
    ( app(app(X0,cons(sk5,nil)),nil) != sk1
    | app(cons(sk5,nil),X0) != sk2
    | ~ ssList(X0)
    | ~ ssList(nil)
    | ~ ssItem(sk5) ),
    inference(superposition,[status(thm)],[c_10141,c_2460]) ).

cnf(c_22878,plain,
    ( app(app(X0,cons(sk5,nil)),nil) != sk1
    | app(cons(sk5,nil),X0) != sk2
    | ~ ssList(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_12459,c_74,c_1590,c_12459]) ).

cnf(c_22887,plain,
    ( app(cons(sk5,nil),sk6) != sk2
    | app(sk1,nil) != sk1
    | ~ ssList(sk6) ),
    inference(superposition,[status(thm)],[c_1770,c_22878]) ).

cnf(c_22889,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_22887,c_9017,c_1772,c_1588]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC417-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n019.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:35:14 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.17/2.20  % SZS status Started for theBenchmark.p
% 10.17/2.20  % SZS status Unsatisfiable for theBenchmark.p
% 10.17/2.20  
% 10.17/2.20  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.17/2.20  
% 10.17/2.20  ------  iProver source info
% 10.17/2.20  
% 10.17/2.20  git: date: 2024-05-02 19:28:25 +0000
% 10.17/2.20  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.17/2.20  git: non_committed_changes: false
% 10.17/2.20  
% 10.17/2.20  ------ Parsing...successful
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  ------ Preprocessing... sup_sim: 9  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e 
% 10.17/2.20  
% 10.17/2.20  ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 10.17/2.20  
% 10.17/2.20  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 10.17/2.20  ------ Proving...
% 10.17/2.20  ------ Problem Properties 
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  clauses                                 187
% 10.17/2.20  conjectures                             4
% 10.17/2.20  EPR                                     59
% 10.17/2.20  Horn                                    159
% 10.17/2.20  unary                                   67
% 10.17/2.20  binary                                  21
% 10.17/2.20  lits                                    555
% 10.17/2.20  lits eq                                 76
% 10.17/2.20  fd_pure                                 0
% 10.17/2.20  fd_pseudo                               0
% 10.17/2.20  fd_cond                                 15
% 10.17/2.20  fd_pseudo_cond                          14
% 10.17/2.20  AC symbols                              0
% 10.17/2.20  
% 10.17/2.20  ------ Input Options Time Limit: Unbounded
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  ------ 
% 10.17/2.20  Current options:
% 10.17/2.20  ------ 
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  ------ Proving...
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  ------ Proving...
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  ------ Proving...
% 10.17/2.20  
% 10.17/2.20  
% 10.17/2.20  % SZS status Unsatisfiable for theBenchmark.p
% 10.17/2.20  
% 10.17/2.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.17/2.20  
% 10.17/2.20  
%------------------------------------------------------------------------------