TSTP Solution File: LCL231-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : LCL231-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n012.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:23 EDT 2024

% Result   : Unsatisfiable 7.92s 1.68s
% Output   : CNFRefutation 7.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  10 unt;   0 nHn;  13 RR)
%            Number of literals    :   39 (   0 equ;  21 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   44 (   1 sgn)

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

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

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

cnf(c_53,plain,
    axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).

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

cnf(c_56,plain,
    ( ~ axiom(or(not(X0),X1))
    | ~ theorem(X0)
    | theorem(X1) ),
    file('/export/starexec/sandbox/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/sandbox/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_229,plain,
    ( ~ theorem(or(X0,or(X1,X2)))
    | theorem(or(X1,or(X0,X2))) ),
    inference(superposition,[status(thm)],[c_53,c_56]) ).

cnf(c_230,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_262,plain,
    ( ~ axiom(or(not(X0),or(X1,X1)))
    | theorem(or(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_217,c_57]) ).

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

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

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

cnf(c_868,plain,
    ( ~ theorem(or(not(or(X0,X1)),X2))
    | theorem(or(not(or(X0,or(X3,X1))),or(X3,X2))) ),
    inference(superposition,[status(thm)],[c_53,c_405]) ).

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

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

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

cnf(c_8923,plain,
    ( ~ axiom(or(not(q),or(not(p),q)))
    | ~ theorem(or(not(r),r)) ),
    inference(superposition,[status(thm)],[c_2294,c_2180]) ).

cnf(c_9125,plain,
    ~ theorem(or(not(r),r)),
    inference(superposition,[status(thm)],[c_51,c_8923]) ).

cnf(c_9131,plain,
    $false,
    inference(superposition,[status(thm)],[c_459,c_9125]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL231-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n012.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 19:06:55 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.19/0.48  Running first-order theorem proving
% 0.19/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.92/1.68  % SZS status Started for theBenchmark.p
% 7.92/1.68  % SZS status Unsatisfiable for theBenchmark.p
% 7.92/1.68  
% 7.92/1.68  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.92/1.68  
% 7.92/1.68  ------  iProver source info
% 7.92/1.68  
% 7.92/1.68  git: date: 2024-05-02 19:28:25 +0000
% 7.92/1.68  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.92/1.68  git: non_committed_changes: false
% 7.92/1.68  
% 7.92/1.68  ------ Parsing...successful
% 7.92/1.68  
% 7.92/1.68  
% 7.92/1.68  
% 7.92/1.68  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 7.92/1.68  
% 7.92/1.68  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.92/1.68  ------ Proving...
% 7.92/1.68  ------ Problem Properties 
% 7.92/1.68  
% 7.92/1.68  
% 7.92/1.68  clauses                                 9
% 7.92/1.68  conjectures                             1
% 7.92/1.68  EPR                                     1
% 7.92/1.68  Horn                                    9
% 7.92/1.68  unary                                   6
% 7.92/1.68  binary                                  1
% 7.92/1.68  lits                                    14
% 7.92/1.68  lits eq                                 0
% 7.92/1.68  fd_pure                                 0
% 7.92/1.68  fd_pseudo                               0
% 7.92/1.68  fd_cond                                 0
% 7.92/1.68  fd_pseudo_cond                          0
% 7.92/1.68  AC symbols                              0
% 7.92/1.68  
% 7.92/1.68  ------ Input Options Time Limit: Unbounded
% 7.92/1.68  
% 7.92/1.68  
% 7.92/1.68  ------ 
% 7.92/1.68  Current options:
% 7.92/1.68  ------ 
% 7.92/1.68  
% 7.92/1.68  
% 7.92/1.68  
% 7.92/1.68  
% 7.92/1.68  ------ Proving...
% 7.92/1.68  
% 7.92/1.68  
% 7.92/1.68  % SZS status Unsatisfiable for theBenchmark.p
% 7.92/1.68  
% 7.92/1.68  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.92/1.69  
% 7.92/1.69  
%------------------------------------------------------------------------------