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

View Problem - Process Solution

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

% Computer : n004.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:56 EDT 2023

% Result   : Unsatisfiable 49.26s 7.28s
% Output   : CNFRefutation 49.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   37 (  23 unt;   0 nHn;  15 RR)
%            Number of literals    :   53 (   6 equ;  18 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   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   :   81 (   4 sgn)

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

cnf(c_50,plain,
    axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

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

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

cnf(c_53,plain,
    axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

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

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

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

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

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

cnf(c_101,plain,
    theorem(implies(or(X0,X0),X0)),
    inference(unflattening,[status(thm)],[c_100]) ).

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

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

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

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

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

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

cnf(c_124,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_125,plain,
    theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(unflattening,[status(thm)],[c_124]) ).

cnf(c_8366,plain,
    theorem(implies(or(X0,not(X1)),implies(X1,X0))),
    inference(superposition,[status(thm)],[c_55,c_113]) ).

cnf(c_8369,plain,
    theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
    inference(superposition,[status(thm)],[c_55,c_8366]) ).

cnf(c_8373,plain,
    theorem(implies(or(not(X0),or(X1,X2)),or(X1,implies(X0,X2)))),
    inference(superposition,[status(thm)],[c_55,c_119]) ).

cnf(c_8374,plain,
    theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
    inference(demodulation,[status(thm)],[c_8373,c_55]) ).

cnf(c_8379,plain,
    theorem(implies(implies(X0,X1),implies(or(not(X2),X0),implies(X2,X1)))),
    inference(superposition,[status(thm)],[c_55,c_125]) ).

cnf(c_8380,plain,
    theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
    inference(demodulation,[status(thm)],[c_8379,c_55]) ).

cnf(c_8394,plain,
    ( ~ theorem(or(X0,X0))
    | theorem(X0) ),
    inference(superposition,[status(thm)],[c_101,c_57]) ).

cnf(c_8403,plain,
    ( ~ theorem(implies(X0,not(X1)))
    | theorem(implies(X1,not(X0))) ),
    inference(superposition,[status(thm)],[c_8369,c_57]) ).

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

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

cnf(c_8476,plain,
    theorem(or(X0,implies(X1,X1))),
    inference(superposition,[status(thm)],[c_107,c_8404]) ).

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

cnf(c_8560,plain,
    theorem(implies(X0,X0)),
    inference(superposition,[status(thm)],[c_8476,c_8394]) ).

cnf(c_8582,plain,
    theorem(implies(X0,not(not(X0)))),
    inference(superposition,[status(thm)],[c_8560,c_8403]) ).

cnf(c_8646,plain,
    ( ~ theorem(implies(X0,implies(X1,not(X2))))
    | theorem(implies(X0,implies(X2,not(X1)))) ),
    inference(superposition,[status(thm)],[c_8369,c_8493]) ).

cnf(c_9571,plain,
    ( ~ theorem(implies(X0,not(X1)))
    | theorem(implies(implies(X2,X0),implies(X1,not(X2)))) ),
    inference(superposition,[status(thm)],[c_8406,c_8646]) ).

cnf(c_60230,plain,
    ~ theorem(implies(q,not(not(q)))),
    inference(superposition,[status(thm)],[c_9571,c_49]) ).

cnf(c_60267,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_60230,c_8582]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL182-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n004.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 : Fri Aug 25 05:07:38 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 49.26/7.28  % SZS status Started for theBenchmark.p
% 49.26/7.28  % SZS status Unsatisfiable for theBenchmark.p
% 49.26/7.28  
% 49.26/7.28  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 49.26/7.28  
% 49.26/7.28  ------  iProver source info
% 49.26/7.28  
% 49.26/7.28  git: date: 2023-05-31 18:12:56 +0000
% 49.26/7.28  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 49.26/7.28  git: non_committed_changes: false
% 49.26/7.28  git: last_make_outside_of_git: false
% 49.26/7.28  
% 49.26/7.28  ------ Parsing...successful
% 49.26/7.28  
% 49.26/7.28  
% 49.26/7.28  
% 49.26/7.28  ------ 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 
% 49.26/7.28  
% 49.26/7.28  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 49.26/7.28  
% 49.26/7.28  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 49.26/7.28  ------ Proving...
% 49.26/7.28  ------ Problem Properties 
% 49.26/7.28  
% 49.26/7.28  
% 49.26/7.28  clauses                                 8
% 49.26/7.28  conjectures                             1
% 49.26/7.28  EPR                                     0
% 49.26/7.28  Horn                                    8
% 49.26/7.28  unary                                   7
% 49.26/7.28  binary                                  0
% 49.26/7.28  lits                                    10
% 49.26/7.28  lits eq                                 1
% 49.26/7.28  fd_pure                                 0
% 49.26/7.28  fd_pseudo                               0
% 49.26/7.28  fd_cond                                 0
% 49.26/7.28  fd_pseudo_cond                          0
% 49.26/7.28  AC symbols                              0
% 49.26/7.28  
% 49.26/7.28  ------ Input Options Time Limit: Unbounded
% 49.26/7.28  
% 49.26/7.28  
% 49.26/7.28  ------ 
% 49.26/7.28  Current options:
% 49.26/7.28  ------ 
% 49.26/7.28  
% 49.26/7.28  
% 49.26/7.28  
% 49.26/7.28  
% 49.26/7.28  ------ Proving...
% 49.26/7.28  
% 49.26/7.28  
% 49.26/7.28  % SZS status Unsatisfiable for theBenchmark.p
% 49.26/7.28  
% 49.26/7.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 49.26/7.28  
% 49.26/7.28  
%------------------------------------------------------------------------------