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

View Problem - Process Solution

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

% Computer : n028.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:19 EDT 2023

% Result   : Unsatisfiable 7.82s 1.64s
% Output   : CNFRefutation 7.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   32 (  13 unt;   0 nHn;  14 RR)
%            Number of literals    :   55 (   0 equ;  24 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   :   84 (  20 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(implies(implies(X0,X1),X2),implies(X1,X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).

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

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

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

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

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

cnf(c_229,plain,
    is_a_theorem(implies(X0,implies(X1,X0))),
    inference(resolution,[status(thm)],[c_179,c_50]) ).

cnf(c_328,plain,
    is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))),
    inference(resolution,[status(thm)],[c_229,c_179]) ).

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

cnf(c_611,plain,
    is_a_theorem(implies(not(implies(X0,X1)),implies(not(X0),X2))),
    inference(resolution,[status(thm)],[c_197,c_51]) ).

cnf(c_939,plain,
    ( ~ is_a_theorem(implies(X0,implies(not(X1),X2)))
    | ~ is_a_theorem(X0)
    | is_a_theorem(implies(implies(X3,X2),implies(implies(X1,X3),X2))) ),
    inference(resolution,[status(thm)],[c_516,c_49]) ).

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

cnf(c_2118,plain,
    is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(implies(X3,X1),X0),implies(X1,X2)))),
    inference(resolution,[status(thm)],[c_1285,c_50]) ).

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

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

cnf(c_3230,plain,
    ( ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),X3)))
    | is_a_theorem(implies(X1,X3)) ),
    inference(resolution,[status(thm)],[c_2397,c_50]) ).

cnf(c_3246,plain,
    ( ~ is_a_theorem(implies(implies(X0,X1),X2))
    | is_a_theorem(implies(X1,implies(X3,X2))) ),
    inference(resolution,[status(thm)],[c_2397,c_328]) ).

cnf(c_4312,plain,
    is_a_theorem(implies(X0,X0)),
    inference(resolution,[status(thm)],[c_3230,c_50]) ).

cnf(c_4314,plain,
    is_a_theorem(implies(implies(not(X0),X1),implies(implies(X2,X1),implies(implies(X0,X2),X1)))),
    inference(resolution,[status(thm)],[c_3230,c_52]) ).

cnf(c_4524,plain,
    ( ~ is_a_theorem(implies(not(X0),X1))
    | is_a_theorem(implies(implies(X2,X1),implies(implies(X0,X2),X1))) ),
    inference(resolution,[status(thm)],[c_4312,c_939]) ).

cnf(c_4529,plain,
    ( ~ is_a_theorem(implies(implies(X0,X1),implies(X1,X2)))
    | is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[status(thm)],[c_4312,c_2397]) ).

cnf(c_4791,plain,
    ( ~ is_a_theorem(implies(X0,implies(X0,X1)))
    | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[c_4529,c_2344]) ).

cnf(c_6063,plain,
    is_a_theorem(implies(implies(not(X0),X1),implies(implies(X0,not(X0)),X1))),
    inference(resolution,[status(thm)],[c_4314,c_4791]) ).

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

cnf(c_6241,plain,
    ( ~ is_a_theorem(implies(not(X0),X1))
    | is_a_theorem(implies(not(X0),implies(X2,X1))) ),
    inference(resolution,[status(thm)],[c_6082,c_3246]) ).

cnf(c_9955,plain,
    ( ~ is_a_theorem(implies(not(X0),X0))
    | is_a_theorem(implies(implies(X0,X0),X0)) ),
    inference(resolution,[status(thm)],[c_4524,c_4791]) ).

cnf(c_9989,plain,
    ( ~ is_a_theorem(implies(not(X0),X0))
    | ~ is_a_theorem(implies(X0,X0))
    | is_a_theorem(X0) ),
    inference(resolution,[status(thm)],[c_9955,c_49]) ).

cnf(c_10065,plain,
    ( ~ is_a_theorem(implies(not(X0),X0))
    | is_a_theorem(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_9989,c_4312,c_9989]) ).

cnf(c_10147,plain,
    ( ~ is_a_theorem(implies(not(implies(X0,X1)),X1))
    | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[c_10065,c_6241]) ).

cnf(c_10990,plain,
    is_a_theorem(implies(X0,implies(not(X0),X1))),
    inference(resolution,[status(thm)],[c_10147,c_611]) ).

cnf(c_11399,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_53,c_10990]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL072-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Aug 24 17:10:35 EDT 2023
% 0.14/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
% 7.82/1.64  % SZS status Started for theBenchmark.p
% 7.82/1.64  % SZS status Unsatisfiable for theBenchmark.p
% 7.82/1.64  
% 7.82/1.64  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.82/1.64  
% 7.82/1.64  ------  iProver source info
% 7.82/1.64  
% 7.82/1.64  git: date: 2023-05-31 18:12:56 +0000
% 7.82/1.64  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.82/1.64  git: non_committed_changes: false
% 7.82/1.64  git: last_make_outside_of_git: false
% 7.82/1.64  
% 7.82/1.64  ------ Parsing...successful
% 7.82/1.64  
% 7.82/1.64  
% 7.82/1.64  
% 7.82/1.64  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 7.82/1.64  
% 7.82/1.64  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.82/1.64  ------ Proving...
% 7.82/1.64  ------ Problem Properties 
% 7.82/1.64  
% 7.82/1.64  
% 7.82/1.64  clauses                                 5
% 7.82/1.64  conjectures                             1
% 7.82/1.64  EPR                                     0
% 7.82/1.64  Horn                                    5
% 7.82/1.64  unary                                   4
% 7.82/1.64  binary                                  0
% 7.82/1.64  lits                                    7
% 7.82/1.64  lits eq                                 0
% 7.82/1.64  fd_pure                                 0
% 7.82/1.64  fd_pseudo                               0
% 7.82/1.64  fd_cond                                 0
% 7.82/1.64  fd_pseudo_cond                          0
% 7.82/1.64  AC symbols                              0
% 7.82/1.64  
% 7.82/1.64  ------ Input Options Time Limit: Unbounded
% 7.82/1.64  
% 7.82/1.64  
% 7.82/1.64  ------ 
% 7.82/1.64  Current options:
% 7.82/1.64  ------ 
% 7.82/1.64  
% 7.82/1.64  
% 7.82/1.64  
% 7.82/1.64  
% 7.82/1.64  ------ Proving...
% 7.82/1.64  
% 7.82/1.64  
% 7.82/1.64  % SZS status Unsatisfiable for theBenchmark.p
% 7.82/1.64  
% 7.82/1.64  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.82/1.64  
% 7.82/1.64  
%------------------------------------------------------------------------------