TSTP Solution File: LCL209-3 by iProver---3.9

View Problem - Process Solution

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

% Computer : n020.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:15 EDT 2024

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

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

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

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

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

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

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

cnf(c_55,plain,
    or(not(X0),X1) = implies(X0,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

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

cnf(c_57,plain,
    ( ~ theorem(implies(X0,X1))
    | ~ theorem(X0)
    | theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).

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

cnf(c_106,plain,
    theorem(implies(or(X0,X0),X0)),
    inference(unflattening,[status(thm)],[c_105]) ).

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

cnf(c_124,plain,
    theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(unflattening,[status(thm)],[c_123]) ).

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_170,plain,
    not(p) = sP0_iProver_def,
    definition ).

cnf(c_171,plain,
    implies(sP0_iProver_def,q) = sP1_iProver_def,
    definition ).

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

cnf(c_173,plain,
    implies(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
    definition ).

cnf(c_174,negated_conjecture,
    ~ theorem(sP3_iProver_def),
    inference(demodulation,[status(thm)],[c_49,c_172,c_170,c_171,c_173]) ).

cnf(c_308,plain,
    implies(p,X0) = or(sP0_iProver_def,X0),
    inference(superposition,[status(thm)],[c_170,c_55]) ).

cnf(c_321,plain,
    ( ~ theorem(or(X0,X0))
    | theorem(X0) ),
    inference(superposition,[status(thm)],[c_106,c_57]) ).

cnf(c_323,plain,
    ( ~ theorem(or(X0,X1))
    | theorem(or(X1,X0)) ),
    inference(superposition,[status(thm)],[c_118,c_57]) ).

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

cnf(c_390,plain,
    ( ~ theorem(or(X0,or(X1,X2)))
    | theorem(or(X1,or(X0,X2))) ),
    inference(superposition,[status(thm)],[c_124,c_57]) ).

cnf(c_418,plain,
    theorem(or(sP0_iProver_def,or(X0,p))),
    inference(superposition,[status(thm)],[c_308,c_112]) ).

cnf(c_501,plain,
    theorem(implies(sP1_iProver_def,implies(or(X0,sP0_iProver_def),or(X0,q)))),
    inference(superposition,[status(thm)],[c_171,c_130]) ).

cnf(c_639,plain,
    theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
    inference(demodulation,[status(thm)],[c_384,c_55]) ).

cnf(c_645,plain,
    theorem(implies(implies(sP1_iProver_def,or(X0,sP2_iProver_def)),or(X0,sP3_iProver_def))),
    inference(superposition,[status(thm)],[c_173,c_639]) ).

cnf(c_751,plain,
    theorem(implies(sP1_iProver_def,implies(or(p,sP0_iProver_def),sP2_iProver_def))),
    inference(superposition,[status(thm)],[c_172,c_501]) ).

cnf(c_919,plain,
    theorem(implies(implies(sP1_iProver_def,implies(X0,sP2_iProver_def)),or(not(X0),sP3_iProver_def))),
    inference(superposition,[status(thm)],[c_55,c_645]) ).

cnf(c_1202,plain,
    theorem(or(X0,or(sP0_iProver_def,p))),
    inference(superposition,[status(thm)],[c_418,c_390]) ).

cnf(c_1291,plain,
    theorem(or(sP0_iProver_def,p)),
    inference(superposition,[status(thm)],[c_1202,c_321]) ).

cnf(c_1296,plain,
    theorem(or(p,sP0_iProver_def)),
    inference(superposition,[status(thm)],[c_1291,c_323]) ).

cnf(c_1870,plain,
    theorem(implies(implies(sP1_iProver_def,implies(X0,sP2_iProver_def)),implies(X0,sP3_iProver_def))),
    inference(demodulation,[status(thm)],[c_919,c_55]) ).

cnf(c_1874,plain,
    ( ~ theorem(implies(sP1_iProver_def,implies(X0,sP2_iProver_def)))
    | theorem(implies(X0,sP3_iProver_def)) ),
    inference(superposition,[status(thm)],[c_1870,c_57]) ).

cnf(c_2663,plain,
    theorem(implies(or(p,sP0_iProver_def),sP3_iProver_def)),
    inference(superposition,[status(thm)],[c_751,c_1874]) ).

cnf(c_3036,plain,
    ( ~ theorem(or(p,sP0_iProver_def))
    | theorem(sP3_iProver_def) ),
    inference(superposition,[status(thm)],[c_2663,c_57]) ).

cnf(c_3037,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3036,c_174,c_1296]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL209-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n020.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu May  2 19:00:31 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  Running first-order theorem proving
% 0.18/0.45  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.46/1.15  % SZS status Started for theBenchmark.p
% 0.46/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 0.46/1.15  
% 0.46/1.15  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.15  
% 0.46/1.15  ------  iProver source info
% 0.46/1.15  
% 0.46/1.15  git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.15  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.15  git: non_committed_changes: false
% 0.46/1.15  
% 0.46/1.15  ------ Parsing...successful
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  ------ 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 
% 0.46/1.15  
% 0.46/1.15  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.46/1.15  
% 0.46/1.15  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.46/1.15  ------ Proving...
% 0.46/1.15  ------ Problem Properties 
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  clauses                                 12
% 0.46/1.15  conjectures                             1
% 0.46/1.15  EPR                                     1
% 0.46/1.15  Horn                                    12
% 0.46/1.15  unary                                   11
% 0.46/1.15  binary                                  0
% 0.46/1.15  lits                                    14
% 0.46/1.15  lits eq                                 5
% 0.46/1.15  fd_pure                                 0
% 0.46/1.15  fd_pseudo                               0
% 0.46/1.15  fd_cond                                 0
% 0.46/1.15  fd_pseudo_cond                          0
% 0.46/1.15  AC symbols                              0
% 0.46/1.15  
% 0.46/1.15  ------ Schedule dynamic 5 is on 
% 0.46/1.15  
% 0.46/1.15  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  ------ 
% 0.46/1.15  Current options:
% 0.46/1.15  ------ 
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  ------ Proving...
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 0.46/1.15  
% 0.46/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15  
% 0.46/1.15  
%------------------------------------------------------------------------------