TSTP Solution File: LCL250-10 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : LCL250-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n013.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:43:32 EDT 2023

% Result   : Unsatisfiable 220.36s 29.11s
% Output   : CNFRefutation 220.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   59 (  59 unt;   0 nHn;   4 RR)
%            Number of literals    :   59 (  58 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-4 aty)
%            Number of variables   :  129 (  20 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ifeq(X0,X0,X1,X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(c_50,plain,
    axiom(implies(or(X0,X0),X0)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).

cnf(c_51,plain,
    axiom(implies(X0,or(X1,X0))) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).

cnf(c_52,plain,
    axiom(implies(or(X0,X1),or(X1,X0))) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).

cnf(c_53,plain,
    axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).

cnf(c_54,plain,
    axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).

cnf(c_55,plain,
    or(not(X0),X1) = implies(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).

cnf(c_56,plain,
    ifeq(axiom(X0),true,theorem(X0),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

cnf(c_57,plain,
    ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

cnf(c_58,plain,
    not(or(not(X0),not(X1))) = and(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).

cnf(c_59,negated_conjecture,
    theorem(implies(implies(q,r),implies(and(p,q),r))) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_198125,plain,
    ifeq(true,true,theorem(implies(or(X0,X0),X0)),true) = true,
    inference(superposition,[status(thm)],[c_50,c_56]) ).

cnf(c_198126,plain,
    ifeq(true,true,theorem(implies(X0,or(X1,X0))),true) = true,
    inference(superposition,[status(thm)],[c_51,c_56]) ).

cnf(c_198127,plain,
    ifeq(true,true,theorem(implies(or(X0,X1),or(X1,X0))),true) = true,
    inference(superposition,[status(thm)],[c_52,c_56]) ).

cnf(c_198128,plain,
    ifeq(true,true,theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),true) = true,
    inference(superposition,[status(thm)],[c_53,c_56]) ).

cnf(c_198129,plain,
    ifeq(true,true,theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),true) = true,
    inference(superposition,[status(thm)],[c_54,c_56]) ).

cnf(c_198130,plain,
    ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
    inference(superposition,[status(thm)],[c_55,c_57]) ).

cnf(c_198133,plain,
    theorem(implies(implies(q,r),or(not(and(p,q)),r))) != true,
    inference(superposition,[status(thm)],[c_55,c_59]) ).

cnf(c_198135,plain,
    theorem(or(not(X0),or(X1,X0))) = true,
    inference(demodulation,[status(thm)],[c_198126,c_49,c_55]) ).

cnf(c_198136,plain,
    theorem(or(not(or(X0,X0)),X0)) = true,
    inference(demodulation,[status(thm)],[c_198125,c_49,c_55]) ).

cnf(c_198137,plain,
    theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))) != true,
    inference(demodulation,[status(thm)],[c_198133,c_55,c_58]) ).

cnf(c_198140,plain,
    theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
    inference(demodulation,[status(thm)],[c_198127,c_49,c_55]) ).

cnf(c_198145,plain,
    theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) = true,
    inference(demodulation,[status(thm)],[c_198129,c_49,c_55]) ).

cnf(c_198146,plain,
    theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
    inference(demodulation,[status(thm)],[c_198128,c_49,c_55]) ).

cnf(c_198153,plain,
    ifeq(theorem(implies(or(not(X0),or(X1,X0)),X2)),true,ifeq(true,true,theorem(X2),true),true) = true,
    inference(superposition,[status(thm)],[c_198135,c_57]) ).

cnf(c_198171,plain,
    ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true) = true,
    inference(superposition,[status(thm)],[c_198140,c_198130]) ).

cnf(c_198182,plain,
    ifeq(theorem(implies(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1))),X3)),true,ifeq(true,true,theorem(X3),true),true) = true,
    inference(superposition,[status(thm)],[c_198145,c_57]) ).

cnf(c_198186,plain,
    ifeq(true,true,ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),true) = true,
    inference(superposition,[status(thm)],[c_198145,c_198130]) ).

cnf(c_198189,plain,
    ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true) = true,
    inference(demodulation,[status(thm)],[c_198171,c_49]) ).

cnf(c_198191,plain,
    ifeq(theorem(or(not(or(not(X0),or(X1,X0))),X2)),true,theorem(X2),true) = true,
    inference(demodulation,[status(thm)],[c_198153,c_49,c_55]) ).

cnf(c_198196,plain,
    ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true) = true,
    inference(demodulation,[status(thm)],[c_198186,c_49]) ).

cnf(c_198200,plain,
    ifeq(theorem(or(not(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),X3)),true,theorem(X3),true) = true,
    inference(demodulation,[status(thm)],[c_198182,c_49,c_55]) ).

cnf(c_198278,plain,
    ifeq(true,true,theorem(or(not(or(X0,X1)),or(X0,or(X2,X1)))),true) = true,
    inference(superposition,[status(thm)],[c_198135,c_198196]) ).

cnf(c_198279,plain,
    ifeq(true,true,theorem(or(not(or(X0,or(X1,X1))),or(X0,X1))),true) = true,
    inference(superposition,[status(thm)],[c_198136,c_198196]) ).

cnf(c_198302,plain,
    ifeq(true,true,theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),true) = true,
    inference(superposition,[status(thm)],[c_198146,c_198200]) ).

cnf(c_198328,plain,
    theorem(or(not(or(X0,or(X1,X1))),or(X0,X1))) = true,
    inference(demodulation,[status(thm)],[c_198279,c_49]) ).

cnf(c_198329,plain,
    theorem(or(not(or(X0,X1)),or(X0,or(X2,X1)))) = true,
    inference(demodulation,[status(thm)],[c_198278,c_49]) ).

cnf(c_198346,plain,
    theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))) = true,
    inference(demodulation,[status(thm)],[c_198302,c_49]) ).

cnf(c_198562,plain,
    ifeq(true,true,theorem(or(not(X0),X0)),true) = true,
    inference(superposition,[status(thm)],[c_198328,c_198191]) ).

cnf(c_198586,plain,
    ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),true) = true,
    inference(superposition,[status(thm)],[c_198329,c_198130]) ).

cnf(c_198731,plain,
    ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(not(or(not(X1),X2)),or(X0,X2))),true),true) = true,
    inference(superposition,[status(thm)],[c_198346,c_198130]) ).

cnf(c_198867,plain,
    theorem(or(not(X0),X0)) = true,
    inference(demodulation,[status(thm)],[c_198562,c_49]) ).

cnf(c_198925,plain,
    ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true) = true,
    inference(demodulation,[status(thm)],[c_198586,c_49]) ).

cnf(c_198986,plain,
    ifeq(theorem(or(X0,X1)),true,theorem(or(not(or(not(X1),X2)),or(X0,X2))),true) = true,
    inference(demodulation,[status(thm)],[c_198731,c_49]) ).

cnf(c_199213,plain,
    ifeq(true,true,theorem(or(X0,not(X0))),true) = true,
    inference(superposition,[status(thm)],[c_198867,c_198189]) ).

cnf(c_199785,plain,
    theorem(or(X0,not(X0))) = true,
    inference(demodulation,[status(thm)],[c_199213,c_49]) ).

cnf(c_200629,plain,
    ifeq(true,true,theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))),true) = true,
    inference(superposition,[status(thm)],[c_199785,c_198196]) ).

cnf(c_201146,plain,
    ifeq(true,true,theorem(or(X0,or(X1,not(X0)))),true) = true,
    inference(superposition,[status(thm)],[c_199785,c_198925]) ).

cnf(c_201238,plain,
    theorem(or(X0,or(X1,not(X0)))) = true,
    inference(demodulation,[status(thm)],[c_201146,c_49]) ).

cnf(c_201272,plain,
    theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))) = true,
    inference(demodulation,[status(thm)],[c_200629,c_49]) ).

cnf(c_202350,plain,
    ifeq(theorem(implies(or(X0,or(X1,not(X0))),X2)),true,ifeq(true,true,theorem(X2),true),true) = true,
    inference(superposition,[status(thm)],[c_201238,c_57]) ).

cnf(c_202502,plain,
    ifeq(theorem(or(not(or(X0,or(X1,not(X0)))),X2)),true,theorem(X2),true) = true,
    inference(demodulation,[status(thm)],[c_202350,c_49,c_55]) ).

cnf(c_339811,plain,
    ifeq(true,true,theorem(or(X0,not(not(or(X1,not(X0)))))),true) = true,
    inference(superposition,[status(thm)],[c_201272,c_202502]) ).

cnf(c_340527,plain,
    theorem(or(X0,not(not(or(X1,not(X0)))))) = true,
    inference(demodulation,[status(thm)],[c_339811,c_49]) ).

cnf(c_344389,plain,
    ifeq(true,true,theorem(or(not(not(or(X0,not(X1)))),X1)),true) = true,
    inference(superposition,[status(thm)],[c_340527,c_198189]) ).

cnf(c_345021,plain,
    theorem(or(not(not(or(X0,not(X1)))),X1)) = true,
    inference(demodulation,[status(thm)],[c_344389,c_49]) ).

cnf(c_345834,plain,
    ifeq(true,true,theorem(or(not(or(not(X0),X1)),or(not(not(or(X2,not(X0)))),X1))),true) = true,
    inference(superposition,[status(thm)],[c_345021,c_198986]) ).

cnf(c_346328,plain,
    theorem(or(not(or(not(X0),X1)),or(not(not(or(X2,not(X0)))),X1))) = true,
    inference(demodulation,[status(thm)],[c_345834,c_49]) ).

cnf(c_346384,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_198137,c_346328]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : LCL250-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.11  % Command  : run_iprover %s %d THM
% 0.10/0.31  % Computer : n013.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Thu Aug 24 19:05:47 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.16/0.41  Running UEQ theorem proving
% 0.16/0.42  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 220.36/29.11  % SZS status Started for theBenchmark.p
% 220.36/29.11  % SZS status Unsatisfiable for theBenchmark.p
% 220.36/29.11  
% 220.36/29.11  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 220.36/29.11  
% 220.36/29.11  ------  iProver source info
% 220.36/29.11  
% 220.36/29.11  git: date: 2023-05-31 18:12:56 +0000
% 220.36/29.11  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 220.36/29.11  git: non_committed_changes: false
% 220.36/29.11  git: last_make_outside_of_git: false
% 220.36/29.11  
% 220.36/29.11  ------ Parsing...successful
% 220.36/29.11  
% 220.36/29.11  
% 220.36/29.11  
% 220.36/29.11  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 220.36/29.11  
% 220.36/29.11  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 220.36/29.11  
% 220.36/29.11  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 220.36/29.11  ------ Proving...
% 220.36/29.11  ------ Problem Properties 
% 220.36/29.11  
% 220.36/29.11  
% 220.36/29.11  clauses                                 11
% 220.36/29.11  conjectures                             1
% 220.36/29.11  EPR                                     0
% 220.36/29.11  Horn                                    11
% 220.36/29.11  unary                                   11
% 220.36/29.11  binary                                  0
% 220.36/29.11  lits                                    11
% 220.36/29.11  lits eq                                 11
% 220.36/29.11  fd_pure                                 0
% 220.36/29.11  fd_pseudo                               0
% 220.36/29.11  fd_cond                                 0
% 220.36/29.11  fd_pseudo_cond                          0
% 220.36/29.11  AC symbols                              0
% 220.36/29.11  
% 220.36/29.11  ------ Input Options Time Limit: Unbounded
% 220.36/29.11  
% 220.36/29.11  
% 220.36/29.11  ------ 
% 220.36/29.11  Current options:
% 220.36/29.11  ------ 
% 220.36/29.11  
% 220.36/29.11  
% 220.36/29.11  
% 220.36/29.11  
% 220.36/29.11  ------ Proving...
% 220.36/29.11  
% 220.36/29.11  
% 220.36/29.11  % SZS status Unsatisfiable for theBenchmark.p
% 220.36/29.11  
% 220.36/29.11  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 220.36/29.11  
% 220.36/29.11  
%------------------------------------------------------------------------------