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

View Problem - Process Solution

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

% Computer : n025.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.80s 1.17s
% Output   : CNFRefutation 3.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  13 unt;   0 nHn;   9 RR)
%            Number of literals    :   31 (   4 equ;  11 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   :   48 (   4 sgn)

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

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_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_111,plain,
    ( implies(X0,or(X1,X0)) != X2
    | theorem(X2) ),
    inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).

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

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

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

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

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

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

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

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

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

cnf(c_920,plain,
    ( ~ theorem(implies(X0,or(X1,not(X2))))
    | theorem(implies(X0,implies(X2,X1))) ),
    inference(superposition,[status(thm)],[c_289,c_515]) ).

cnf(c_3221,plain,
    theorem(implies(not(X0),implies(X0,X1))),
    inference(superposition,[status(thm)],[c_112,c_920]) ).

cnf(c_3231,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_49,c_3221]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL186-3 : TPTP v8.1.2. Released v2.3.0.
% 0.12/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug 24 17:17:51 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.80/1.17  % SZS status Started for theBenchmark.p
% 3.80/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 3.80/1.17  
% 3.80/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.80/1.17  
% 3.80/1.17  ------  iProver source info
% 3.80/1.17  
% 3.80/1.17  git: date: 2023-05-31 18:12:56 +0000
% 3.80/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.80/1.17  git: non_committed_changes: false
% 3.80/1.17  git: last_make_outside_of_git: false
% 3.80/1.17  
% 3.80/1.17  ------ Parsing...successful
% 3.80/1.17  
% 3.80/1.17  
% 3.80/1.17  
% 3.80/1.17  ------ 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.80/1.17  
% 3.80/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.80/1.17  
% 3.80/1.17  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.80/1.17  ------ Proving...
% 3.80/1.17  ------ Problem Properties 
% 3.80/1.17  
% 3.80/1.17  
% 3.80/1.17  clauses                                 8
% 3.80/1.17  conjectures                             1
% 3.80/1.17  EPR                                     0
% 3.80/1.17  Horn                                    8
% 3.80/1.17  unary                                   7
% 3.80/1.17  binary                                  0
% 3.80/1.17  lits                                    10
% 3.80/1.17  lits eq                                 1
% 3.80/1.17  fd_pure                                 0
% 3.80/1.17  fd_pseudo                               0
% 3.80/1.17  fd_cond                                 0
% 3.80/1.17  fd_pseudo_cond                          0
% 3.80/1.17  AC symbols                              0
% 3.80/1.17  
% 3.80/1.17  ------ Input Options Time Limit: Unbounded
% 3.80/1.17  
% 3.80/1.17  
% 3.80/1.17  ------ 
% 3.80/1.17  Current options:
% 3.80/1.17  ------ 
% 3.80/1.17  
% 3.80/1.17  
% 3.80/1.17  
% 3.80/1.17  
% 3.80/1.17  ------ Proving...
% 3.80/1.17  
% 3.80/1.17  
% 3.80/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 3.80/1.17  
% 3.80/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.80/1.17  
% 3.80/1.17  
%------------------------------------------------------------------------------