TSTP Solution File: LCL260-3 by iProver---3.9

View Problem - Process Solution

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

% Computer : n015.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:37:30 EDT 2024

% Result   : Unsatisfiable 145.91s 20.22s
% Output   : CNFRefutation 145.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   48 (  23 unt;   0 nHn;  22 RR)
%            Number of literals    :   74 (   6 equ;  28 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   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   :   95 (   8 sgn)

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

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

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_53,plain,
    axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/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/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_89,plain,
    ~ theorem(implies(or(p,q),implies(implies(p,q),q))),
    inference(demodulation,[status(thm)],[c_49,c_55]) ).

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

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

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

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

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

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

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

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

cnf(c_353,plain,
    theorem(implies(X0,implies(X1,X0))),
    inference(superposition,[status(thm)],[c_55,c_104]) ).

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

cnf(c_391,plain,
    ( ~ theorem(or(X0,X1))
    | theorem(or(X1,X0)) ),
    inference(superposition,[status(thm)],[c_110,c_57]) ).

cnf(c_394,plain,
    ( ~ theorem(X0)
    | theorem(implies(X1,X0)) ),
    inference(superposition,[status(thm)],[c_353,c_57]) ).

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

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

cnf(c_1019,plain,
    theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
    inference(superposition,[status(thm)],[c_55,c_889]) ).

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

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

cnf(c_1312,plain,
    theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
    inference(superposition,[status(thm)],[c_55,c_1079]) ).

cnf(c_1320,plain,
    theorem(or(X0,implies(X1,X1))),
    inference(superposition,[status(thm)],[c_104,c_1081]) ).

cnf(c_1323,plain,
    ( ~ theorem(or(X0,X1))
    | theorem(or(X0,implies(X2,X1))) ),
    inference(superposition,[status(thm)],[c_394,c_1081]) ).

cnf(c_1325,plain,
    ( ~ theorem(implies(X0,X1))
    | theorem(or(X2,implies(or(X2,X0),X1))) ),
    inference(superposition,[status(thm)],[c_949,c_1081]) ).

cnf(c_1442,plain,
    theorem(implies(X0,X0)),
    inference(superposition,[status(thm)],[c_1320,c_389]) ).

cnf(c_1444,plain,
    theorem(implies(q,q)),
    inference(instantiation,[status(thm)],[c_1442]) ).

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

cnf(c_5813,plain,
    ( ~ theorem(implies(X0,X1))
    | theorem(or(implies(or(X2,X0),X1),X2)) ),
    inference(superposition,[status(thm)],[c_1325,c_391]) ).

cnf(c_9982,plain,
    theorem(implies(or(X0,X1),implies(implies(X1,X2),or(X0,X2)))),
    inference(superposition,[status(thm)],[c_122,c_4092]) ).

cnf(c_9986,plain,
    ( ~ theorem(implies(X0,X1))
    | theorem(implies(X0,implies(X2,X1))) ),
    inference(superposition,[status(thm)],[c_394,c_4092]) ).

cnf(c_28314,plain,
    ( ~ theorem(or(implies(X0,X1),X1))
    | theorem(implies(X0,X1)) ),
    inference(superposition,[status(thm)],[c_1323,c_389]) ).

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

cnf(c_82058,plain,
    ( ~ theorem(or(implies(or(p,q),implies(implies(p,q),q)),implies(implies(p,q),q)))
    | theorem(implies(or(p,q),implies(implies(p,q),q))) ),
    inference(instantiation,[status(thm)],[c_28314]) ).

cnf(c_82396,plain,
    ( ~ theorem(implies(implies(p,q),or(implies(or(p,q),implies(implies(p,q),q)),q)))
    | theorem(or(implies(or(p,q),implies(implies(p,q),q)),implies(implies(p,q),q))) ),
    inference(instantiation,[status(thm)],[c_1081]) ).

cnf(c_115512,plain,
    ( ~ theorem(or(implies(or(p,q),implies(implies(p,q),q)),p))
    | theorem(implies(implies(p,q),or(implies(or(p,q),implies(implies(p,q),q)),q))) ),
    inference(instantiation,[status(thm)],[c_39612]) ).

cnf(c_207618,plain,
    ( ~ theorem(implies(X0,q))
    | theorem(implies(X0,implies(implies(p,q),q))) ),
    inference(instantiation,[status(thm)],[c_9986]) ).

cnf(c_207619,plain,
    ( ~ theorem(implies(q,q))
    | theorem(implies(q,implies(implies(p,q),q))) ),
    inference(instantiation,[status(thm)],[c_207618]) ).

cnf(c_560910,plain,
    ( ~ theorem(implies(q,implies(implies(p,q),q)))
    | theorem(or(implies(or(p,q),implies(implies(p,q),q)),p)) ),
    inference(instantiation,[status(thm)],[c_5813]) ).

cnf(c_560911,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_560910,c_207619,c_115512,c_82396,c_82058,c_1444,c_89]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL260-3 : TPTP v8.1.2. Released v2.3.0.
% 0.10/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.32  % Computer : n015.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Thu May  2 19:28:35 EDT 2024
% 0.12/0.32  % CPUTime  : 
% 0.18/0.44  Running first-order theorem proving
% 0.18/0.44  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
% 145.91/20.22  % SZS status Started for theBenchmark.p
% 145.91/20.22  % SZS status Unsatisfiable for theBenchmark.p
% 145.91/20.22  
% 145.91/20.22  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 145.91/20.22  
% 145.91/20.22  ------  iProver source info
% 145.91/20.22  
% 145.91/20.22  git: date: 2024-05-02 19:28:25 +0000
% 145.91/20.22  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 145.91/20.22  git: non_committed_changes: false
% 145.91/20.22  
% 145.91/20.22  ------ Parsing...successful
% 145.91/20.22  
% 145.91/20.22  
% 145.91/20.22  
% 145.91/20.22  ------ Preprocessing... sup_sim: 1  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 
% 145.91/20.22  
% 145.91/20.22  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 145.91/20.22  
% 145.91/20.22  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 145.91/20.22  ------ Proving...
% 145.91/20.22  ------ Problem Properties 
% 145.91/20.22  
% 145.91/20.22  
% 145.91/20.22  clauses                                 8
% 145.91/20.22  conjectures                             0
% 145.91/20.22  EPR                                     0
% 145.91/20.22  Horn                                    8
% 145.91/20.22  unary                                   7
% 145.91/20.22  binary                                  0
% 145.91/20.22  lits                                    10
% 145.91/20.22  lits eq                                 1
% 145.91/20.22  fd_pure                                 0
% 145.91/20.22  fd_pseudo                               0
% 145.91/20.22  fd_cond                                 0
% 145.91/20.22  fd_pseudo_cond                          0
% 145.91/20.22  AC symbols                              0
% 145.91/20.22  
% 145.91/20.22  ------ Input Options Time Limit: Unbounded
% 145.91/20.22  
% 145.91/20.22  
% 145.91/20.22  ------ 
% 145.91/20.22  Current options:
% 145.91/20.22  ------ 
% 145.91/20.22  
% 145.91/20.22  
% 145.91/20.22  
% 145.91/20.22  
% 145.91/20.22  ------ Proving...
% 145.91/20.22  
% 145.91/20.22  
% 145.91/20.22  % SZS status Unsatisfiable for theBenchmark.p
% 145.91/20.22  
% 145.91/20.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 145.91/20.22  
% 145.91/20.24  
%------------------------------------------------------------------------------