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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : LCL046-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n021.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:42:12 EDT 2023

% Result   : Unsatisfiable 2.02s 1.15s
% Output   : CNFRefutation 2.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (   9 unt;   0 nHn;  12 RR)
%            Number of literals    :   30 (   0 equ;  15 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    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   20 (   1 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(a,a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_16) ).

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

cnf(c_55,plain,
    is_a_theorem(implies(implies(not(a),a),a)),
    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(a,implies(not(a),a)),implies(implies(implies(not(a),a),a),implies(a,a))))
    | ~ is_a_theorem(implies(a,implies(not(a),a)))
    | is_a_theorem(implies(implies(implies(not(a),a),a),implies(a,a))) ),
    inference(instantiation,[status(thm)],[c_85]) ).

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

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(a),a),a),implies(a,a)))
    | ~ is_a_theorem(implies(implies(not(a),a),a))
    | is_a_theorem(implies(a,a)) ),
    inference(instantiation,[status(thm)],[c_153]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL046-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n021.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.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri Aug 25 05:58:11 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.02/1.15  % SZS status Started for theBenchmark.p
% 2.02/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 2.02/1.15  
% 2.02/1.15  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.02/1.15  
% 2.02/1.15  ------  iProver source info
% 2.02/1.15  
% 2.02/1.15  git: date: 2023-05-31 18:12:56 +0000
% 2.02/1.15  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.02/1.15  git: non_committed_changes: false
% 2.02/1.15  git: last_make_outside_of_git: false
% 2.02/1.15  
% 2.02/1.15  ------ Parsing...successful
% 2.02/1.15  
% 2.02/1.15  
% 2.02/1.15  
% 2.02/1.15  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.02/1.15  
% 2.02/1.15  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.02/1.15  ------ Proving...
% 2.02/1.15  ------ Problem Properties 
% 2.02/1.15  
% 2.02/1.15  
% 2.02/1.15  clauses                                 5
% 2.02/1.15  conjectures                             1
% 2.02/1.15  EPR                                     0
% 2.02/1.15  Horn                                    5
% 2.02/1.15  unary                                   4
% 2.02/1.15  binary                                  0
% 2.02/1.15  lits                                    7
% 2.02/1.15  lits eq                                 0
% 2.02/1.15  fd_pure                                 0
% 2.02/1.15  fd_pseudo                               0
% 2.02/1.15  fd_cond                                 0
% 2.02/1.15  fd_pseudo_cond                          0
% 2.02/1.15  AC symbols                              0
% 2.02/1.15  
% 2.02/1.15  ------ Schedule dynamic 5 is on 
% 2.02/1.15  
% 2.02/1.15  ------ no equalities: superposition off 
% 2.02/1.15  
% 2.02/1.15  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.02/1.15  
% 2.02/1.15  
% 2.02/1.15  ------ 
% 2.02/1.15  Current options:
% 2.02/1.15  ------ 
% 2.02/1.15  
% 2.02/1.15  
% 2.02/1.15  
% 2.02/1.15  
% 2.02/1.15  ------ Proving...
% 2.02/1.15  
% 2.02/1.15  
% 2.02/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 2.02/1.15  
% 2.02/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.02/1.15  
% 2.02/1.15  
%------------------------------------------------------------------------------