TSTP Solution File: LCL185-3 by iProver---3.8

View Problem - Process Solution

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

% Computer : n022.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:58 EDT 2023

% Result   : Unsatisfiable 3.93s 1.11s
% Output   : CNFRefutation 3.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;  11 RR)
%            Number of literals    :   34 (   4 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   46 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ~ theorem(implies(p,or(p,q))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_51,plain,
    axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

cnf(c_52,plain,
    axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).

cnf(c_54,plain,
    axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

cnf(c_55,plain,
    or(not(X0),X1) = implies(X0,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

cnf(c_56,plain,
    ( ~ axiom(X0)
    | theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).

cnf(c_57,plain,
    ( ~ theorem(implies(X0,X1))
    | ~ theorem(X0)
    | theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).

cnf(c_102,plain,
    ( implies(X0,or(X1,X0)) != X2
    | theorem(X2) ),
    inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).

cnf(c_103,plain,
    theorem(implies(X0,or(X1,X0))),
    inference(unflattening,[status(thm)],[c_102]) ).

cnf(c_108,plain,
    ( implies(or(X0,X1),or(X1,X0)) != X2
    | theorem(X2) ),
    inference(resolution_lifted,[status(thm)],[c_52,c_56]) ).

cnf(c_109,plain,
    theorem(implies(or(X0,X1),or(X1,X0))),
    inference(unflattening,[status(thm)],[c_108]) ).

cnf(c_120,plain,
    ( implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))) != X3
    | theorem(X3) ),
    inference(resolution_lifted,[status(thm)],[c_54,c_56]) ).

cnf(c_121,plain,
    theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(unflattening,[status(thm)],[c_120]) ).

cnf(c_721,plain,
    ( ~ theorem(implies(X0,X1))
    | theorem(implies(or(X2,X0),or(X2,X1))) ),
    inference(superposition,[status(thm)],[c_121,c_57]) ).

cnf(c_1152,plain,
    ( ~ theorem(or(X0,X1))
    | ~ theorem(implies(X1,X2))
    | theorem(or(X0,X2)) ),
    inference(superposition,[status(thm)],[c_721,c_57]) ).

cnf(c_2025,plain,
    ( ~ theorem(implies(X0,X1))
    | ~ theorem(implies(X1,X2))
    | theorem(or(not(X0),X2)) ),
    inference(superposition,[status(thm)],[c_55,c_1152]) ).

cnf(c_2032,plain,
    ( ~ theorem(implies(X0,X1))
    | ~ theorem(implies(X1,X2))
    | theorem(implies(X0,X2)) ),
    inference(demodulation,[status(thm)],[c_2025,c_55]) ).

cnf(c_2673,plain,
    ( ~ theorem(implies(or(X0,X1),X2))
    | theorem(implies(X1,X2)) ),
    inference(superposition,[status(thm)],[c_103,c_2032]) ).

cnf(c_2841,plain,
    theorem(implies(X0,or(X0,X1))),
    inference(superposition,[status(thm)],[c_109,c_2673]) ).

cnf(c_2858,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_49,c_2841]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL185-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Fri Aug 25 01:43:11 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.93/1.11  % SZS status Started for theBenchmark.p
% 3.93/1.11  % SZS status Unsatisfiable for theBenchmark.p
% 3.93/1.11  
% 3.93/1.11  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.93/1.11  
% 3.93/1.11  ------  iProver source info
% 3.93/1.11  
% 3.93/1.11  git: date: 2023-05-31 18:12:56 +0000
% 3.93/1.11  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.93/1.11  git: non_committed_changes: false
% 3.93/1.11  git: last_make_outside_of_git: false
% 3.93/1.11  
% 3.93/1.11  ------ Parsing...successful
% 3.93/1.11  
% 3.93/1.11  
% 3.93/1.11  
% 3.93/1.11  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e 
% 3.93/1.11  
% 3.93/1.11  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.93/1.11  
% 3.93/1.11  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.93/1.11  ------ Proving...
% 3.93/1.11  ------ Problem Properties 
% 3.93/1.11  
% 3.93/1.11  
% 3.93/1.11  clauses                                 8
% 3.93/1.11  conjectures                             1
% 3.93/1.11  EPR                                     0
% 3.93/1.11  Horn                                    8
% 3.93/1.11  unary                                   7
% 3.93/1.11  binary                                  0
% 3.93/1.11  lits                                    10
% 3.93/1.11  lits eq                                 1
% 3.93/1.11  fd_pure                                 0
% 3.93/1.11  fd_pseudo                               0
% 3.93/1.11  fd_cond                                 0
% 3.93/1.11  fd_pseudo_cond                          0
% 3.93/1.11  AC symbols                              0
% 3.93/1.11  
% 3.93/1.11  ------ Input Options Time Limit: Unbounded
% 3.93/1.11  
% 3.93/1.11  
% 3.93/1.11  ------ 
% 3.93/1.11  Current options:
% 3.93/1.11  ------ 
% 3.93/1.11  
% 3.93/1.11  
% 3.93/1.11  
% 3.93/1.11  
% 3.93/1.11  ------ Proving...
% 3.93/1.11  
% 3.93/1.11  
% 3.93/1.11  % SZS status Unsatisfiable for theBenchmark.p
% 3.93/1.11  
% 3.93/1.11  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.93/1.11  
% 3.93/1.11  
%------------------------------------------------------------------------------