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

View Problem - Process Solution

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

% Computer : n003.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:35 EDT 2023

% Result   : Unsatisfiable 6.89s 1.66s
% Output   : CNFRefutation 6.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   23 (  11 unt;   0 nHn;  10 RR)
%            Number of literals    :   38 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   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   :   45 (   6 sgn)

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

cnf(c_50,plain,
    is_a_theorem(implies(X0,implies(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).

cnf(c_51,plain,
    is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).

cnf(c_52,plain,
    is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).

cnf(c_53,plain,
    is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).

cnf(c_54,negated_conjecture,
    ~ is_a_theorem(implies(not(implies(a,b)),not(b))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_39) ).

cnf(c_180,plain,
    ( ~ is_a_theorem(X0)
    | is_a_theorem(implies(X1,X0)) ),
    inference(resolution,[status(thm)],[c_49,c_50]) ).

cnf(c_222,plain,
    ( ~ is_a_theorem(implies(not(X0),not(X1)))
    | is_a_theorem(implies(X1,X0)) ),
    inference(resolution,[status(thm)],[c_53,c_49]) ).

cnf(c_269,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(implies(implies(X1,X2),implies(X0,X2))) ),
    inference(resolution,[status(thm)],[c_51,c_49]) ).

cnf(c_278,plain,
    ( ~ is_a_theorem(implies(implies(X0,X1),X1))
    | is_a_theorem(implies(implies(X1,X0),X0)) ),
    inference(resolution,[status(thm)],[c_52,c_49]) ).

cnf(c_335,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | ~ is_a_theorem(implies(X1,X2))
    | is_a_theorem(implies(X0,X2)) ),
    inference(resolution,[status(thm)],[c_269,c_49]) ).

cnf(c_363,plain,
    ( ~ is_a_theorem(X0)
    | is_a_theorem(implies(implies(X0,X1),X1)) ),
    inference(resolution,[status(thm)],[c_278,c_180]) ).

cnf(c_403,plain,
    ( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
    | is_a_theorem(implies(X0,implies(X2,X1))) ),
    inference(resolution,[status(thm)],[c_335,c_53]) ).

cnf(c_406,plain,
    ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
    | ~ is_a_theorem(X1)
    | is_a_theorem(implies(X0,X2)) ),
    inference(resolution,[status(thm)],[c_335,c_363]) ).

cnf(c_720,plain,
    is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[status(thm)],[c_403,c_50]) ).

cnf(c_1029,plain,
    is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
    inference(resolution,[status(thm)],[c_720,c_403]) ).

cnf(c_1188,plain,
    ( ~ is_a_theorem(X0)
    | is_a_theorem(implies(not(not(X1)),X1)) ),
    inference(resolution,[status(thm)],[c_1029,c_406]) ).

cnf(c_1276,plain,
    is_a_theorem(implies(not(not(X0)),X0)),
    inference(resolution,[status(thm)],[c_1188,c_50]) ).

cnf(c_1458,plain,
    is_a_theorem(implies(X0,not(not(X0)))),
    inference(resolution,[status(thm)],[c_1276,c_222]) ).

cnf(c_1744,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(implies(X0,not(not(X1)))) ),
    inference(resolution,[status(thm)],[c_1458,c_335]) ).

cnf(c_13858,plain,
    ( ~ is_a_theorem(implies(not(X0),X1))
    | is_a_theorem(implies(not(X1),X0)) ),
    inference(resolution,[status(thm)],[c_1744,c_222]) ).

cnf(c_24063,plain,
    is_a_theorem(implies(not(implies(X0,X1)),not(X1))),
    inference(resolution,[status(thm)],[c_13858,c_1029]) ).

cnf(c_28146,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_54,c_24063]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL115-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n003.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 Aug 24 17:24:08 EDT 2023
% 0.13/0.34  % 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 --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.89/1.66  % SZS status Started for theBenchmark.p
% 6.89/1.66  % SZS status Unsatisfiable for theBenchmark.p
% 6.89/1.66  
% 6.89/1.66  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 6.89/1.66  
% 6.89/1.66  ------  iProver source info
% 6.89/1.66  
% 6.89/1.66  git: date: 2023-05-31 18:12:56 +0000
% 6.89/1.66  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 6.89/1.66  git: non_committed_changes: false
% 6.89/1.66  git: last_make_outside_of_git: false
% 6.89/1.66  
% 6.89/1.66  ------ Parsing...successful
% 6.89/1.66  
% 6.89/1.66  
% 6.89/1.66  
% 6.89/1.66  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 6.89/1.66  
% 6.89/1.66  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 6.89/1.66  ------ Proving...
% 6.89/1.66  ------ Problem Properties 
% 6.89/1.66  
% 6.89/1.66  
% 6.89/1.66  clauses                                 6
% 6.89/1.66  conjectures                             1
% 6.89/1.66  EPR                                     0
% 6.89/1.66  Horn                                    6
% 6.89/1.66  unary                                   5
% 6.89/1.66  binary                                  0
% 6.89/1.66  lits                                    8
% 6.89/1.66  lits eq                                 0
% 6.89/1.66  fd_pure                                 0
% 6.89/1.66  fd_pseudo                               0
% 6.89/1.66  fd_cond                                 0
% 6.89/1.66  fd_pseudo_cond                          0
% 6.89/1.66  AC symbols                              0
% 6.89/1.66  
% 6.89/1.66  ------ Input Options Time Limit: Unbounded
% 6.89/1.66  
% 6.89/1.66  
% 6.89/1.66  ------ 
% 6.89/1.66  Current options:
% 6.89/1.66  ------ 
% 6.89/1.66  
% 6.89/1.66  
% 6.89/1.66  
% 6.89/1.66  
% 6.89/1.66  ------ Proving...
% 6.89/1.66  
% 6.89/1.66  
% 6.89/1.66  % SZS status Unsatisfiable for theBenchmark.p
% 6.89/1.66  
% 6.89/1.66  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.89/1.66  
% 6.89/1.66  
%------------------------------------------------------------------------------