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

View Problem - Process Solution

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

% Computer : n029.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:16 EDT 2024

% Result   : Unsatisfiable 9.59s 2.05s
% Output   : CNFRefutation 9.59s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ~ theorem(or(not(not(q)),or(not(or(p,q)),p))),
    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_52,plain,
    axiom(or(not(or(X0,X1)),or(X1,X0))),
    file('/export/starexec/sandbox/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/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_216,plain,
    not(q) = sP0_iProver_def,
    definition ).

cnf(c_217,plain,
    not(sP0_iProver_def) = sP1_iProver_def,
    definition ).

cnf(c_218,plain,
    or(p,q) = sP2_iProver_def,
    definition ).

cnf(c_219,plain,
    not(sP2_iProver_def) = sP3_iProver_def,
    definition ).

cnf(c_220,plain,
    or(sP3_iProver_def,p) = sP4_iProver_def,
    definition ).

cnf(c_221,plain,
    or(sP1_iProver_def,sP4_iProver_def) = sP5_iProver_def,
    definition ).

cnf(c_222,negated_conjecture,
    ~ theorem(sP5_iProver_def),
    inference(demodulation,[status(thm)],[c_49,c_218,c_219,c_220,c_216,c_217,c_221]) ).

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

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

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

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

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

cnf(c_484,plain,
    axiom(or(not(or(not(q),X0)),or(not(sP2_iProver_def),or(p,X0)))),
    inference(superposition,[status(thm)],[c_218,c_54]) ).

cnf(c_492,plain,
    axiom(or(not(or(sP0_iProver_def,X0)),or(sP3_iProver_def,or(p,X0)))),
    inference(light_normalisation,[status(thm)],[c_484,c_216,c_219]) ).

cnf(c_807,plain,
    theorem(or(not(or(sP3_iProver_def,or(X0,p))),or(X0,sP4_iProver_def))),
    inference(superposition,[status(thm)],[c_220,c_435]) ).

cnf(c_924,plain,
    ( ~ theorem(or(X0,X1))
    | theorem(or(X0,or(X2,X1))) ),
    inference(superposition,[status(thm)],[c_405,c_436]) ).

cnf(c_1836,plain,
    theorem(or(X0,or(not(or(sP3_iProver_def,or(X0,p))),sP4_iProver_def))),
    inference(superposition,[status(thm)],[c_807,c_436]) ).

cnf(c_1918,plain,
    ( ~ theorem(or(X0,p))
    | theorem(or(X0,sP4_iProver_def)) ),
    inference(superposition,[status(thm)],[c_220,c_924]) ).

cnf(c_1921,plain,
    ( ~ theorem(or(or(X0,X1),X1))
    | theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_924,c_404]) ).

cnf(c_3486,plain,
    theorem(or(or(not(or(sP3_iProver_def,or(X0,p))),sP4_iProver_def),X0)),
    inference(superposition,[status(thm)],[c_1836,c_406]) ).

cnf(c_4895,plain,
    theorem(or(or(not(or(sP3_iProver_def,or(p,p))),sP4_iProver_def),sP4_iProver_def)),
    inference(superposition,[status(thm)],[c_3486,c_1918]) ).

cnf(c_6642,plain,
    theorem(or(not(or(sP3_iProver_def,or(p,p))),sP4_iProver_def)),
    inference(superposition,[status(thm)],[c_4895,c_1921]) ).

cnf(c_6643,plain,
    ( ~ axiom(or(not(X0),or(sP3_iProver_def,or(p,p))))
    | theorem(or(not(X0),sP4_iProver_def)) ),
    inference(superposition,[status(thm)],[c_6642,c_57]) ).

cnf(c_23297,plain,
    theorem(or(not(or(sP0_iProver_def,p)),sP4_iProver_def)),
    inference(superposition,[status(thm)],[c_492,c_6643]) ).

cnf(c_23391,plain,
    ( ~ axiom(or(not(X0),or(sP0_iProver_def,p)))
    | theorem(or(not(X0),sP4_iProver_def)) ),
    inference(superposition,[status(thm)],[c_23297,c_57]) ).

cnf(c_23570,plain,
    theorem(or(not(or(p,sP0_iProver_def)),sP4_iProver_def)),
    inference(superposition,[status(thm)],[c_52,c_23391]) ).

cnf(c_23591,plain,
    ( ~ axiom(or(not(X0),or(p,sP0_iProver_def)))
    | theorem(or(not(X0),sP4_iProver_def)) ),
    inference(superposition,[status(thm)],[c_23570,c_57]) ).

cnf(c_24268,plain,
    theorem(or(not(sP0_iProver_def),sP4_iProver_def)),
    inference(superposition,[status(thm)],[c_51,c_23591]) ).

cnf(c_24273,plain,
    theorem(sP5_iProver_def),
    inference(light_normalisation,[status(thm)],[c_24268,c_217,c_221]) ).

cnf(c_24274,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_24273,c_222]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : LCL211-1 : TPTP v8.1.2. Released v1.1.0.
% 0.02/0.11  % Command  : run_iprover %s %d THM
% 0.10/0.31  % Computer : n029.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 May  2 19:25:07 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.16/0.41  Running first-order theorem proving
% 0.16/0.41  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
% 9.59/2.05  % SZS status Started for theBenchmark.p
% 9.59/2.05  % SZS status Unsatisfiable for theBenchmark.p
% 9.59/2.05  
% 9.59/2.05  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 9.59/2.05  
% 9.59/2.05  ------  iProver source info
% 9.59/2.05  
% 9.59/2.05  git: date: 2024-05-02 19:28:25 +0000
% 9.59/2.05  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 9.59/2.05  git: non_committed_changes: false
% 9.59/2.05  
% 9.59/2.05  ------ Parsing...successful
% 9.59/2.05  
% 9.59/2.05  
% 9.59/2.05  
% 9.59/2.05  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 9.59/2.05  
% 9.59/2.05  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 9.59/2.05  
% 9.59/2.05  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 9.59/2.05  ------ Proving...
% 9.59/2.05  ------ Problem Properties 
% 9.59/2.05  
% 9.59/2.05  
% 9.59/2.05  clauses                                 15
% 9.59/2.05  conjectures                             1
% 9.59/2.05  EPR                                     2
% 9.59/2.05  Horn                                    15
% 9.59/2.05  unary                                   12
% 9.59/2.05  binary                                  1
% 9.59/2.05  lits                                    20
% 9.59/2.05  lits eq                                 6
% 9.59/2.05  fd_pure                                 0
% 9.59/2.05  fd_pseudo                               0
% 9.59/2.05  fd_cond                                 0
% 9.59/2.05  fd_pseudo_cond                          0
% 9.59/2.05  AC symbols                              0
% 9.59/2.05  
% 9.59/2.05  ------ Schedule dynamic 5 is on 
% 9.59/2.05  
% 9.59/2.05  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 9.59/2.05  
% 9.59/2.05  
% 9.59/2.05  ------ 
% 9.59/2.05  Current options:
% 9.59/2.05  ------ 
% 9.59/2.05  
% 9.59/2.05  
% 9.59/2.05  
% 9.59/2.05  
% 9.59/2.05  ------ Proving...
% 9.59/2.05  
% 9.59/2.05  
% 9.59/2.05  % SZS status Unsatisfiable for theBenchmark.p
% 9.59/2.05  
% 9.59/2.05  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.59/2.05  
% 9.59/2.05  
%------------------------------------------------------------------------------