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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : LCL112-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 : Fri May  3 02:36:53 EDT 2024

% Result   : Unsatisfiable 0.50s 1.18s
% Output   : CNFRefutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   21 (  11 unt;   0 nHn;   9 RR)
%            Number of literals    :   34 (   0 equ;  14 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    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   39 (   5 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(X0,implies(X1,X0))),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mv_3) ).

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

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

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_1134,plain,
    ( ~ is_a_theorem(X0)
    | is_a_theorem(implies(not(not(X1)),X1)) ),
    inference(resolution,[status(thm)],[c_1029,c_406]) ).

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

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

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

cnf(c_1270,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1269,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : LCL112-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.35  % Computer : n003.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu May  2 19:00:50 EDT 2024
% 0.15/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.50/1.18  % SZS status Started for theBenchmark.p
% 0.50/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 0.50/1.18  
% 0.50/1.18  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.50/1.18  
% 0.50/1.18  ------  iProver source info
% 0.50/1.18  
% 0.50/1.18  git: date: 2024-05-02 19:28:25 +0000
% 0.50/1.18  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.50/1.18  git: non_committed_changes: false
% 0.50/1.18  
% 0.50/1.18  ------ Parsing...successful
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.50/1.18  
% 0.50/1.18  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.50/1.18  ------ Proving...
% 0.50/1.18  ------ Problem Properties 
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  clauses                                 6
% 0.50/1.18  conjectures                             1
% 0.50/1.18  EPR                                     0
% 0.50/1.18  Horn                                    6
% 0.50/1.18  unary                                   5
% 0.50/1.18  binary                                  0
% 0.50/1.18  lits                                    8
% 0.50/1.18  lits eq                                 0
% 0.50/1.18  fd_pure                                 0
% 0.50/1.18  fd_pseudo                               0
% 0.50/1.18  fd_cond                                 0
% 0.50/1.18  fd_pseudo_cond                          0
% 0.50/1.18  AC symbols                              0
% 0.50/1.18  
% 0.50/1.18  ------ Input Options Time Limit: Unbounded
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  ------ 
% 0.50/1.18  Current options:
% 0.50/1.18  ------ 
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  ------ Proving...
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 0.50/1.18  
% 0.50/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.50/1.18  
% 0.50/1.18  
%------------------------------------------------------------------------------