TSTP Solution File: LCL242-1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : LCL242-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n011.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:28 EDT 2023

% Result   : Satisfiable 179.02s 24.35s
% Output   : Saturation 179.02s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

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

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

cnf(c_53,plain,
    axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).

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

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

cnf(c_56,plain,
    ( ~ axiom(or(not(X0),X1))
    | ~ theorem(X0)
    | theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).

cnf(c_57,plain,
    ( ~ theorem(or(not(X0),X1))
    | ~ axiom(or(not(X2),X0))
    | theorem(or(not(X2),X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).

cnf(c_217,plain,
    theorem(or(not(or(X0,X0)),X0)),
    inference(superposition,[status(thm)],[c_50,c_55]) ).

cnf(c_219,plain,
    theorem(or(not(X0),or(X1,X0))),
    inference(superposition,[status(thm)],[c_51,c_55]) ).

cnf(c_221,plain,
    theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(superposition,[status(thm)],[c_52,c_55]) ).

cnf(c_223,plain,
    theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(superposition,[status(thm)],[c_53,c_55]) ).

cnf(c_228,plain,
    ( ~ theorem(or(X0,X0))
    | theorem(X0) ),
    inference(superposition,[status(thm)],[c_50,c_56]) ).

cnf(c_229,plain,
    ( ~ theorem(X0)
    | theorem(or(X1,X0)) ),
    inference(superposition,[status(thm)],[c_51,c_56]) ).

cnf(c_230,plain,
    ( ~ theorem(or(X0,X1))
    | theorem(or(X1,X0)) ),
    inference(superposition,[status(thm)],[c_52,c_56]) ).

cnf(c_231,plain,
    ( ~ theorem(or(X0,or(X1,X2)))
    | theorem(or(X1,or(X0,X2))) ),
    inference(superposition,[status(thm)],[c_53,c_56]) ).

cnf(c_234,plain,
    theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(superposition,[status(thm)],[c_54,c_55]) ).

cnf(c_235,plain,
    ( ~ theorem(or(not(X0),X1))
    | theorem(or(not(or(X2,X0)),or(X2,X1))) ),
    inference(superposition,[status(thm)],[c_54,c_56]) ).

cnf(c_239,plain,
    ( ~ axiom(or(not(X0),or(X1,X1)))
    | theorem(or(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_217,c_57]) ).

cnf(c_240,plain,
    ( ~ axiom(or(not(X0),X1))
    | theorem(or(not(X0),or(X2,X1))) ),
    inference(superposition,[status(thm)],[c_219,c_57]) ).

cnf(c_241,plain,
    ( ~ axiom(or(not(X0),or(X1,X2)))
    | theorem(or(not(X0),or(X2,X1))) ),
    inference(superposition,[status(thm)],[c_221,c_57]) ).

cnf(c_245,plain,
    ~ theorem(or(not(p),or(not(q),r))),
    inference(superposition,[status(thm)],[c_229,c_49]) ).

cnf(c_246,plain,
    ( ~ axiom(or(not(X0),X1))
    | ~ theorem(X2)
    | theorem(or(not(X0),X2)) ),
    inference(superposition,[status(thm)],[c_229,c_57]) ).

cnf(c_249,plain,
    ~ theorem(or(not(q),r)),
    inference(superposition,[status(thm)],[c_229,c_245]) ).

cnf(c_251,plain,
    ~ theorem(r),
    inference(superposition,[status(thm)],[c_229,c_249]) ).

cnf(c_257,plain,
    theorem(or(X0,not(or(X0,X0)))),
    inference(superposition,[status(thm)],[c_217,c_230]) ).

cnf(c_258,plain,
    theorem(or(or(X0,X1),not(X1))),
    inference(superposition,[status(thm)],[c_219,c_230]) ).

cnf(c_259,plain,
    ( ~ theorem(X0)
    | theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_229,c_230]) ).

cnf(c_260,plain,
    theorem(or(or(X0,X1),not(or(X1,X0)))),
    inference(superposition,[status(thm)],[c_221,c_230]) ).

cnf(c_263,plain,
    ( ~ axiom(or(not(X0),X1))
    | theorem(or(not(X0),not(or(not(X1),not(X1))))) ),
    inference(superposition,[status(thm)],[c_257,c_57]) ).

cnf(c_360,plain,
    ~ theorem(not(or(not(not(or(not(p),not(q)))),r))),
    inference(superposition,[status(thm)],[c_259,c_49]) ).

cnf(c_361,plain,
    ( ~ axiom(or(not(X0),X1))
    | ~ theorem(not(X1))
    | theorem(or(not(X0),X2)) ),
    inference(superposition,[status(thm)],[c_259,c_57]) ).

cnf(c_364,plain,
    ~ theorem(not(p)),
    inference(superposition,[status(thm)],[c_259,c_245]) ).

cnf(c_365,plain,
    ~ theorem(not(q)),
    inference(superposition,[status(thm)],[c_259,c_249]) ).

cnf(c_420,plain,
    ( ~ axiom(or(not(X0),or(X1,or(X2,X3))))
    | theorem(or(not(X0),or(X2,or(X1,X3)))) ),
    inference(superposition,[status(thm)],[c_223,c_57]) ).

cnf(c_421,plain,
    theorem(or(or(X0,or(X1,X2)),not(or(X1,or(X0,X2))))),
    inference(superposition,[status(thm)],[c_223,c_230]) ).

cnf(c_721,plain,
    theorem(or(X0,or(not(X1),X1))),
    inference(superposition,[status(thm)],[c_219,c_231]) ).

cnf(c_723,plain,
    theorem(or(X0,or(not(or(X1,X0)),X1))),
    inference(superposition,[status(thm)],[c_221,c_231]) ).

cnf(c_991,plain,
    theorem(or(not(X0),X0)),
    inference(superposition,[status(thm)],[c_51,c_239]) ).

cnf(c_1405,plain,
    theorem(or(X0,not(X0))),
    inference(superposition,[status(thm)],[c_991,c_230]) ).

cnf(c_7306,plain,
    theorem(or(or(not(X0),X0),X1)),
    inference(superposition,[status(thm)],[c_721,c_230]) ).

cnf(c_29931,plain,
    ( ~ theorem(X0)
    | theorem(or(not(X1),X0)) ),
    inference(superposition,[status(thm)],[c_51,c_246]) ).

cnf(c_33594,plain,
    ( ~ theorem(X0)
    | theorem(or(X0,not(X1))) ),
    inference(superposition,[status(thm)],[c_29931,c_230]) ).

cnf(c_40578,plain,
    theorem(or(not(X0),or(X0,X1))),
    inference(superposition,[status(thm)],[c_51,c_241]) ).

cnf(c_57065,plain,
    theorem(or(or(X0,X1),not(X0))),
    inference(superposition,[status(thm)],[c_40578,c_230]) ).

cnf(c_57066,plain,
    theorem(or(X0,or(not(X0),X1))),
    inference(superposition,[status(thm)],[c_40578,c_231]) ).

cnf(c_69128,plain,
    theorem(or(or(not(X0),X1),X0)),
    inference(superposition,[status(thm)],[c_57066,c_230]) ).

cnf(c_87219,plain,
    ( ~ theorem(not(X0))
    | theorem(or(not(or(X0,X0)),X1)) ),
    inference(superposition,[status(thm)],[c_50,c_361]) ).

cnf(c_87220,plain,
    ( ~ theorem(not(or(X0,X1)))
    | theorem(or(not(X1),X2)) ),
    inference(superposition,[status(thm)],[c_51,c_361]) ).

cnf(c_87221,plain,
    ( ~ theorem(not(or(X0,X1)))
    | theorem(or(not(or(X1,X0)),X2)) ),
    inference(superposition,[status(thm)],[c_52,c_361]) ).

cnf(c_119000,plain,
    ( ~ theorem(not(X0))
    | theorem(not(or(X0,X0))) ),
    inference(superposition,[status(thm)],[c_87219,c_228]) ).

cnf(c_119001,plain,
    ( ~ theorem(not(X0))
    | theorem(or(X1,not(or(X0,X0)))) ),
    inference(superposition,[status(thm)],[c_87219,c_230]) ).

cnf(c_141483,plain,
    theorem(or(not(or(X0,X1)),or(X0,or(X2,X1)))),
    inference(superposition,[status(thm)],[c_51,c_420]) ).

cnf(c_141484,plain,
    theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
    inference(superposition,[status(thm)],[c_52,c_420]) ).

cnf(c_148683,plain,
    ( ~ theorem(not(X0))
    | theorem(or(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_119000,c_87220]) ).

cnf(c_153676,plain,
    ( ~ theorem(not(X0))
    | theorem(or(X1,not(X0))) ),
    inference(superposition,[status(thm)],[c_148683,c_230]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL242-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.06/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Fri Aug 25 02:48:38 EDT 2023
% 0.12/0.34  % 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
% 179.02/24.35  % SZS status Started for theBenchmark.p
% 179.02/24.35  % SZS status Satisfiable for theBenchmark.p
% 179.02/24.35  
% 179.02/24.35  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 179.02/24.35  
% 179.02/24.35  ------  iProver source info
% 179.02/24.35  
% 179.02/24.35  git: date: 2023-05-31 18:12:56 +0000
% 179.02/24.35  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 179.02/24.35  git: non_committed_changes: false
% 179.02/24.35  git: last_make_outside_of_git: false
% 179.02/24.35  
% 179.02/24.35  ------ Parsing...successful
% 179.02/24.35  
% 179.02/24.35  
% 179.02/24.35  
% 179.02/24.35  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 179.02/24.35  
% 179.02/24.35  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 179.02/24.35  ------ Proving...
% 179.02/24.35  ------ Problem Properties 
% 179.02/24.35  
% 179.02/24.35  
% 179.02/24.35  clauses                                 9
% 179.02/24.35  conjectures                             1
% 179.02/24.35  EPR                                     1
% 179.02/24.35  Horn                                    9
% 179.02/24.35  unary                                   6
% 179.02/24.35  binary                                  1
% 179.02/24.35  lits                                    14
% 179.02/24.35  lits eq                                 0
% 179.02/24.35  fd_pure                                 0
% 179.02/24.35  fd_pseudo                               0
% 179.02/24.35  fd_cond                                 0
% 179.02/24.35  fd_pseudo_cond                          0
% 179.02/24.35  AC symbols                              0
% 179.02/24.35  
% 179.02/24.35  ------ Input Options Time Limit: Unbounded
% 179.02/24.35  
% 179.02/24.35  
% 179.02/24.35  ------ 
% 179.02/24.35  Current options:
% 179.02/24.35  ------ 
% 179.02/24.35  
% 179.02/24.35  
% 179.02/24.35  
% 179.02/24.35  
% 179.02/24.35  ------ Proving...
% 179.02/24.35  
% 179.02/24.35  
% 179.02/24.35  % SZS status Satisfiable for theBenchmark.p
% 179.02/24.35  
% 179.02/24.35  % SZS output start Saturation for theBenchmark.p
% See solution above
% 179.02/24.35  
% 179.02/24.36  
%------------------------------------------------------------------------------