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

View Problem - Process Solution

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

% Computer : n026.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:19 EDT 2024

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

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

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

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_53,plain,
    axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/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/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_104,plain,
    ( implies(or(X0,X0),X0) != X1
    | theorem(X1) ),
    inference(resolution_lifted,[status(thm)],[c_50,c_56]) ).

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

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

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

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

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

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

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

cnf(c_168,plain,
    implies(p,q) = sP0_iProver_def,
    definition ).

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

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

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

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

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

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

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

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

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

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

cnf(c_421,plain,
    theorem(implies(or(q,not(p)),sP0_iProver_def)),
    inference(superposition,[status(thm)],[c_168,c_297]) ).

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

cnf(c_485,plain,
    theorem(implies(implies(X0,q),implies(or(p,X0),sP2_iProver_def))),
    inference(superposition,[status(thm)],[c_170,c_129]) ).

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

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

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

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

cnf(c_1256,plain,
    ( ~ theorem(or(X0,X1))
    | theorem(or(X0,or(X2,X1))) ),
    inference(superposition,[status(thm)],[c_308,c_389]) ).

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

cnf(c_1464,plain,
    theorem(implies(sP1_iProver_def,implies(implies(X0,sP0_iProver_def),implies(X0,q)))),
    inference(superposition,[status(thm)],[c_169,c_1462]) ).

cnf(c_1471,plain,
    theorem(implies(implies(X0,sP2_iProver_def),implies(implies(sP1_iProver_def,X0),sP3_iProver_def))),
    inference(superposition,[status(thm)],[c_171,c_1462]) ).

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

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

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

cnf(c_2216,plain,
    theorem(or(X0,implies(X1,X1))),
    inference(superposition,[status(thm)],[c_111,c_639]) ).

cnf(c_2450,plain,
    theorem(implies(X0,X0)),
    inference(superposition,[status(thm)],[c_2216,c_307]) ).

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

cnf(c_4738,plain,
    ( ~ theorem(implies(X0,sP2_iProver_def))
    | ~ theorem(implies(sP1_iProver_def,X0)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_4737,c_172]) ).

cnf(c_8898,plain,
    theorem(implies(or(p,X0),implies(implies(X0,q),sP2_iProver_def))),
    inference(superposition,[status(thm)],[c_485,c_1971]) ).

cnf(c_8912,plain,
    theorem(implies(implies(X0,sP0_iProver_def),implies(sP1_iProver_def,implies(X0,q)))),
    inference(superposition,[status(thm)],[c_1464,c_1971]) ).

cnf(c_11437,plain,
    ( ~ theorem(or(p,X0))
    | theorem(implies(implies(X0,q),sP2_iProver_def)) ),
    inference(superposition,[status(thm)],[c_8898,c_57]) ).

cnf(c_11507,plain,
    ( ~ theorem(implies(X0,sP0_iProver_def))
    | theorem(implies(sP1_iProver_def,implies(X0,q))) ),
    inference(superposition,[status(thm)],[c_8912,c_57]) ).

cnf(c_11737,plain,
    ( ~ theorem(implies(sP1_iProver_def,implies(X0,q)))
    | ~ theorem(or(p,X0)) ),
    inference(superposition,[status(thm)],[c_11437,c_4738]) ).

cnf(c_12311,plain,
    ( ~ theorem(implies(X0,sP0_iProver_def))
    | ~ theorem(or(p,X0)) ),
    inference(superposition,[status(thm)],[c_11507,c_11737]) ).

cnf(c_12374,plain,
    ~ theorem(or(p,or(q,not(p)))),
    inference(superposition,[status(thm)],[c_421,c_12311]) ).

cnf(c_12407,plain,
    ~ theorem(or(p,not(p))),
    inference(superposition,[status(thm)],[c_1256,c_12374]) ).

cnf(c_12578,plain,
    ~ theorem(implies(p,p)),
    inference(superposition,[status(thm)],[c_515,c_12407]) ).

cnf(c_12579,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_12578,c_2450]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL219-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % 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 May  2 19:28:36 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  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
% 8.22/1.69  % SZS status Started for theBenchmark.p
% 8.22/1.69  % SZS status Unsatisfiable for theBenchmark.p
% 8.22/1.69  
% 8.22/1.69  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.22/1.69  
% 8.22/1.69  ------  iProver source info
% 8.22/1.69  
% 8.22/1.69  git: date: 2024-05-02 19:28:25 +0000
% 8.22/1.69  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.22/1.69  git: non_committed_changes: false
% 8.22/1.69  
% 8.22/1.69  ------ Parsing...successful
% 8.22/1.69  
% 8.22/1.69  
% 8.22/1.69  
% 8.22/1.69  ------ 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 
% 8.22/1.69  
% 8.22/1.69  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 8.22/1.69  
% 8.22/1.69  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 8.22/1.69  ------ Proving...
% 8.22/1.69  ------ Problem Properties 
% 8.22/1.69  
% 8.22/1.69  
% 8.22/1.69  clauses                                 12
% 8.22/1.69  conjectures                             1
% 8.22/1.69  EPR                                     1
% 8.22/1.69  Horn                                    12
% 8.22/1.69  unary                                   11
% 8.22/1.69  binary                                  0
% 8.22/1.69  lits                                    14
% 8.22/1.69  lits eq                                 5
% 8.22/1.69  fd_pure                                 0
% 8.22/1.69  fd_pseudo                               0
% 8.22/1.69  fd_cond                                 0
% 8.22/1.69  fd_pseudo_cond                          0
% 8.22/1.69  AC symbols                              0
% 8.22/1.69  
% 8.22/1.69  ------ Schedule dynamic 5 is on 
% 8.22/1.69  
% 8.22/1.69  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.22/1.69  
% 8.22/1.69  
% 8.22/1.69  ------ 
% 8.22/1.69  Current options:
% 8.22/1.69  ------ 
% 8.22/1.69  
% 8.22/1.69  
% 8.22/1.69  
% 8.22/1.69  
% 8.22/1.69  ------ Proving...
% 8.22/1.69  
% 8.22/1.69  
% 8.22/1.69  % SZS status Unsatisfiable for theBenchmark.p
% 8.22/1.69  
% 8.22/1.69  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.22/1.69  
% 8.22/1.70  
%------------------------------------------------------------------------------