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

View Problem - Process Solution

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

% Computer : n016.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:18 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ~ theorem(or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(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_216,plain,
    not(p) = sP0_iProver_def,
    definition ).

cnf(c_217,plain,
    or(sP0_iProver_def,q) = sP1_iProver_def,
    definition ).

cnf(c_218,plain,
    not(sP1_iProver_def) = sP2_iProver_def,
    definition ).

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

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

cnf(c_221,plain,
    not(sP4_iProver_def) = sP5_iProver_def,
    definition ).

cnf(c_222,plain,
    or(sP5_iProver_def,sP0_iProver_def) = sP6_iProver_def,
    definition ).

cnf(c_223,plain,
    or(sP2_iProver_def,sP6_iProver_def) = sP7_iProver_def,
    definition ).

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

cnf(c_404,plain,
    axiom(or(not(sP4_iProver_def),or(sP3_iProver_def,sP0_iProver_def))),
    inference(superposition,[status(thm)],[c_220,c_52]) ).

cnf(c_412,plain,
    axiom(or(sP5_iProver_def,or(sP3_iProver_def,sP0_iProver_def))),
    inference(light_normalisation,[status(thm)],[c_404,c_221]) ).

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

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

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

cnf(c_494,plain,
    axiom(or(not(or(sP2_iProver_def,or(X0,sP6_iProver_def))),or(X0,sP7_iProver_def))),
    inference(superposition,[status(thm)],[c_223,c_53]) ).

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

cnf(c_548,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_682,plain,
    theorem(or(sP5_iProver_def,or(sP3_iProver_def,sP0_iProver_def))),
    inference(superposition,[status(thm)],[c_412,c_55]) ).

cnf(c_1078,plain,
    ( ~ theorem(or(X0,X1))
    | theorem(or(X0,or(X2,X1))) ),
    inference(superposition,[status(thm)],[c_439,c_496]) ).

cnf(c_1086,plain,
    theorem(or(sP3_iProver_def,or(sP5_iProver_def,sP0_iProver_def))),
    inference(superposition,[status(thm)],[c_682,c_496]) ).

cnf(c_1094,plain,
    theorem(or(sP3_iProver_def,sP6_iProver_def)),
    inference(light_normalisation,[status(thm)],[c_1086,c_222]) ).

cnf(c_1414,plain,
    ( ~ theorem(or(not(q),X0))
    | theorem(or(not(sP1_iProver_def),or(sP0_iProver_def,X0))) ),
    inference(superposition,[status(thm)],[c_217,c_548]) ).

cnf(c_1440,plain,
    ( ~ theorem(or(sP3_iProver_def,X0))
    | theorem(or(sP2_iProver_def,or(sP0_iProver_def,X0))) ),
    inference(light_normalisation,[status(thm)],[c_1414,c_218,c_219]) ).

cnf(c_1911,plain,
    ( ~ theorem(or(sP2_iProver_def,or(X0,sP6_iProver_def)))
    | theorem(or(X0,sP7_iProver_def)) ),
    inference(superposition,[status(thm)],[c_494,c_56]) ).

cnf(c_2410,plain,
    ( ~ theorem(or(X0,sP0_iProver_def))
    | theorem(or(X0,sP6_iProver_def)) ),
    inference(superposition,[status(thm)],[c_222,c_1078]) ).

cnf(c_2411,plain,
    ( ~ theorem(or(X0,sP6_iProver_def))
    | theorem(or(X0,sP7_iProver_def)) ),
    inference(superposition,[status(thm)],[c_223,c_1078]) ).

cnf(c_3389,plain,
    ( ~ theorem(or(sP3_iProver_def,sP6_iProver_def))
    | theorem(or(sP0_iProver_def,sP7_iProver_def)) ),
    inference(superposition,[status(thm)],[c_1440,c_1911]) ).

cnf(c_3399,plain,
    theorem(or(sP0_iProver_def,sP7_iProver_def)),
    inference(forward_subsumption_resolution,[status(thm)],[c_3389,c_1094]) ).

cnf(c_3414,plain,
    theorem(or(sP7_iProver_def,sP0_iProver_def)),
    inference(superposition,[status(thm)],[c_3399,c_440]) ).

cnf(c_3416,plain,
    theorem(or(sP7_iProver_def,sP6_iProver_def)),
    inference(superposition,[status(thm)],[c_3414,c_2410]) ).

cnf(c_3418,plain,
    theorem(or(sP7_iProver_def,sP7_iProver_def)),
    inference(superposition,[status(thm)],[c_3416,c_2411]) ).

cnf(c_3438,plain,
    theorem(sP7_iProver_def),
    inference(superposition,[status(thm)],[c_3418,c_438]) ).

cnf(c_3440,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3438,c_224]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL217-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n016.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Thu May  2 19:43:00 EDT 2024
% 0.11/0.33  % CPUTime  : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/0.44  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
% 3.84/1.14  % SZS status Started for theBenchmark.p
% 3.84/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 3.84/1.14  
% 3.84/1.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.84/1.14  
% 3.84/1.14  ------  iProver source info
% 3.84/1.14  
% 3.84/1.14  git: date: 2024-05-02 19:28:25 +0000
% 3.84/1.14  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.84/1.14  git: non_committed_changes: false
% 3.84/1.14  
% 3.84/1.14  ------ Parsing...successful
% 3.84/1.14  
% 3.84/1.14  
% 3.84/1.14  
% 3.84/1.14  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.84/1.14  
% 3.84/1.14  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.84/1.14  
% 3.84/1.14  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.84/1.14  ------ Proving...
% 3.84/1.14  ------ Problem Properties 
% 3.84/1.14  
% 3.84/1.14  
% 3.84/1.14  clauses                                 17
% 3.84/1.14  conjectures                             1
% 3.84/1.14  EPR                                     2
% 3.84/1.14  Horn                                    17
% 3.84/1.14  unary                                   14
% 3.84/1.14  binary                                  1
% 3.84/1.14  lits                                    22
% 3.84/1.14  lits eq                                 8
% 3.84/1.14  fd_pure                                 0
% 3.84/1.14  fd_pseudo                               0
% 3.84/1.14  fd_cond                                 0
% 3.84/1.14  fd_pseudo_cond                          0
% 3.84/1.14  AC symbols                              0
% 3.84/1.14  
% 3.84/1.14  ------ Schedule dynamic 5 is on 
% 3.84/1.14  
% 3.84/1.14  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.84/1.14  
% 3.84/1.14  
% 3.84/1.14  ------ 
% 3.84/1.14  Current options:
% 3.84/1.14  ------ 
% 3.84/1.14  
% 3.84/1.14  
% 3.84/1.14  
% 3.84/1.14  
% 3.84/1.14  ------ Proving...
% 3.84/1.14  
% 3.84/1.14  
% 3.84/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 3.84/1.14  
% 3.84/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.84/1.14  
% 3.84/1.14  
%------------------------------------------------------------------------------