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

View Problem - Process Solution

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

% Computer : n015.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 07:44:13 EDT 2023

% Result   : Unsatisfiable 1.65s 1.17s
% Output   : CNFRefutation 1.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   18 (  10 unt;   0 nHn;  13 RR)
%            Number of literals    :   33 (   0 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | ~ is_a_theorem(X0)
    | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(c_50,plain,
    is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).

cnf(c_51,plain,
    is_a_theorem(implies(implies(not(X0),X0),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).

cnf(c_52,plain,
    is_a_theorem(implies(X0,implies(not(X0),X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

cnf(c_53,negated_conjecture,
    ~ is_a_theorem(implies(not(implies(x,x)),y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_64) ).

cnf(c_54,plain,
    is_a_theorem(implies(x,implies(not(x),x))),
    inference(instantiation,[status(thm)],[c_52]) ).

cnf(c_55,plain,
    is_a_theorem(implies(implies(not(x),x),x)),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_71,plain,
    ( ~ is_a_theorem(implies(implies(implies(not(X0),X0),X0),X1))
    | ~ is_a_theorem(implies(implies(not(X0),X0),X0))
    | is_a_theorem(X1) ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_73,plain,
    ( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2))
    | ~ is_a_theorem(implies(X0,implies(not(X0),X1)))
    | is_a_theorem(X2) ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_85,plain,
    ( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),implies(implies(implies(not(X0),X1),X2),implies(X0,X2))))
    | ~ is_a_theorem(implies(X0,implies(not(X0),X1)))
    | is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))) ),
    inference(instantiation,[status(thm)],[c_73]) ).

cnf(c_86,plain,
    is_a_theorem(implies(implies(X0,implies(not(X0),X1)),implies(implies(implies(not(X0),X1),X2),implies(X0,X2)))),
    inference(instantiation,[status(thm)],[c_50]) ).

cnf(c_87,plain,
    ( ~ is_a_theorem(implies(implies(x,implies(not(x),x)),implies(implies(implies(not(x),x),x),implies(x,x))))
    | ~ is_a_theorem(implies(x,implies(not(x),x)))
    | is_a_theorem(implies(implies(implies(not(x),x),x),implies(x,x))) ),
    inference(instantiation,[status(thm)],[c_85]) ).

cnf(c_88,plain,
    is_a_theorem(implies(implies(x,implies(not(x),x)),implies(implies(implies(not(x),x),x),implies(x,x)))),
    inference(instantiation,[status(thm)],[c_86]) ).

cnf(c_135,plain,
    ( ~ is_a_theorem(X0)
    | is_a_theorem(implies(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_52,c_49]) ).

cnf(c_153,plain,
    ( ~ is_a_theorem(implies(implies(implies(not(X0),X0),X0),implies(X0,X0)))
    | ~ is_a_theorem(implies(implies(not(X0),X0),X0))
    | is_a_theorem(implies(X0,X0)) ),
    inference(instantiation,[status(thm)],[c_71]) ).

cnf(c_154,plain,
    ( ~ is_a_theorem(implies(implies(implies(not(x),x),x),implies(x,x)))
    | ~ is_a_theorem(implies(implies(not(x),x),x))
    | is_a_theorem(implies(x,x)) ),
    inference(instantiation,[status(thm)],[c_153]) ).

cnf(c_178,plain,
    ~ is_a_theorem(implies(x,x)),
    inference(superposition,[status(thm)],[c_135,c_53]) ).

cnf(c_183,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_178,c_154,c_88,c_87,c_55,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL398-1 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.17/0.34  % Computer : n015.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Thu Aug 24 19:01:36 EDT 2023
% 0.20/0.35  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.65/1.17  % SZS status Started for theBenchmark.p
% 1.65/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 1.65/1.17  
% 1.65/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.65/1.17  
% 1.65/1.17  ------  iProver source info
% 1.65/1.17  
% 1.65/1.17  git: date: 2023-05-31 18:12:56 +0000
% 1.65/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.65/1.17  git: non_committed_changes: false
% 1.65/1.17  git: last_make_outside_of_git: false
% 1.65/1.17  
% 1.65/1.17  ------ Parsing...successful
% 1.65/1.17  
% 1.65/1.17  
% 1.65/1.17  
% 1.65/1.17  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.65/1.17  
% 1.65/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.65/1.17  ------ Proving...
% 1.65/1.17  ------ Problem Properties 
% 1.65/1.17  
% 1.65/1.17  
% 1.65/1.17  clauses                                 5
% 1.65/1.17  conjectures                             1
% 1.65/1.17  EPR                                     0
% 1.65/1.17  Horn                                    5
% 1.65/1.17  unary                                   4
% 1.65/1.17  binary                                  0
% 1.65/1.17  lits                                    7
% 1.65/1.17  lits eq                                 0
% 1.65/1.17  fd_pure                                 0
% 1.65/1.17  fd_pseudo                               0
% 1.65/1.17  fd_cond                                 0
% 1.65/1.17  fd_pseudo_cond                          0
% 1.65/1.17  AC symbols                              0
% 1.65/1.17  
% 1.65/1.17  ------ Schedule dynamic 5 is on 
% 1.65/1.17  
% 1.65/1.17  ------ no equalities: superposition off 
% 1.65/1.17  
% 1.65/1.17  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.65/1.17  
% 1.65/1.17  
% 1.65/1.17  ------ 
% 1.65/1.17  Current options:
% 1.65/1.17  ------ 
% 1.65/1.17  
% 1.65/1.17  
% 1.65/1.17  
% 1.65/1.17  
% 1.65/1.17  ------ Proving...
% 1.65/1.17  
% 1.65/1.17  
% 1.65/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 1.65/1.17  
% 1.65/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/1.17  
% 1.65/1.17  
%------------------------------------------------------------------------------