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

View Problem - Process Solution

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

% Computer : n017.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 : Mon Jun 24 11:05:06 EDT 2024

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

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

cnf(c_50,plain,
    and(implies(X0,X1),implies(X1,X0)) = equivalent(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).

cnf(c_51,plain,
    not(or(not(X0),not(X1))) = and(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).

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

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

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

cnf(c_55,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_56,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_57,plain,
    or(not(X0),X1) = implies(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

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

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

cnf(c_105,plain,
    not(implies(X0,not(X1))) = and(X0,X1),
    inference(demodulation,[status(thm)],[c_51,c_57]) ).

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

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

cnf(c_123,plain,
    ( implies(X0,or(X1,X0)) != X2
    | theorem(X2) ),
    inference(resolution_lifted,[status(thm)],[c_53,c_58]) ).

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

cnf(c_129,plain,
    ( implies(or(X0,X1),or(X1,X0)) != X2
    | theorem(X2) ),
    inference(resolution_lifted,[status(thm)],[c_54,c_58]) ).

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

cnf(c_135,plain,
    ( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
    | theorem(X3) ),
    inference(resolution_lifted,[status(thm)],[c_55,c_58]) ).

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

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

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

cnf(c_188,plain,
    not(p) = sP0_iProver_def,
    definition ).

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

cnf(c_190,plain,
    equivalent(p,sP1_iProver_def) = sP2_iProver_def,
    definition ).

cnf(c_191,negated_conjecture,
    ~ theorem(sP2_iProver_def),
    inference(demodulation,[status(thm)],[c_49,c_188,c_189,c_190]) ).

cnf(c_354,plain,
    implies(p,X0) = or(sP0_iProver_def,X0),
    inference(superposition,[status(thm)],[c_188,c_57]) ).

cnf(c_355,plain,
    implies(sP0_iProver_def,X0) = or(sP1_iProver_def,X0),
    inference(superposition,[status(thm)],[c_189,c_57]) ).

cnf(c_357,plain,
    theorem(implies(or(X0,not(X1)),implies(X1,X0))),
    inference(superposition,[status(thm)],[c_57,c_130]) ).

cnf(c_366,plain,
    theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
    inference(superposition,[status(thm)],[c_57,c_136]) ).

cnf(c_377,plain,
    ( ~ theorem(or(X0,X0))
    | theorem(X0) ),
    inference(superposition,[status(thm)],[c_118,c_59]) ).

cnf(c_379,plain,
    ( ~ theorem(or(X0,X1))
    | theorem(or(X1,X0)) ),
    inference(superposition,[status(thm)],[c_130,c_59]) ).

cnf(c_380,plain,
    ( ~ theorem(or(X0,or(X1,X2)))
    | theorem(or(X1,or(X0,X2))) ),
    inference(superposition,[status(thm)],[c_136,c_59]) ).

cnf(c_393,plain,
    not(implies(X0,sP1_iProver_def)) = and(X0,sP0_iProver_def),
    inference(superposition,[status(thm)],[c_189,c_105]) ).

cnf(c_423,plain,
    and(or(sP0_iProver_def,X0),implies(X0,p)) = equivalent(p,X0),
    inference(superposition,[status(thm)],[c_354,c_50]) ).

cnf(c_428,plain,
    theorem(or(sP0_iProver_def,or(X0,p))),
    inference(superposition,[status(thm)],[c_354,c_124]) ).

cnf(c_461,plain,
    theorem(or(sP1_iProver_def,or(X0,sP0_iProver_def))),
    inference(superposition,[status(thm)],[c_355,c_124]) ).

cnf(c_496,plain,
    theorem(implies(or(sP1_iProver_def,X0),implies(or(X1,sP0_iProver_def),or(X1,X0)))),
    inference(superposition,[status(thm)],[c_355,c_142]) ).

cnf(c_520,plain,
    ( ~ theorem(or(X0,not(X1)))
    | theorem(implies(X1,X0)) ),
    inference(superposition,[status(thm)],[c_357,c_59]) ).

cnf(c_658,plain,
    theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
    inference(demodulation,[status(thm)],[c_366,c_57]) ).

cnf(c_665,plain,
    ( ~ theorem(implies(X0,or(X1,X2)))
    | theorem(or(X1,implies(X0,X2))) ),
    inference(superposition,[status(thm)],[c_658,c_59]) ).

cnf(c_712,plain,
    not(or(sP0_iProver_def,sP1_iProver_def)) = and(p,sP0_iProver_def),
    inference(superposition,[status(thm)],[c_354,c_393]) ).

cnf(c_1042,plain,
    implies(or(sP0_iProver_def,sP1_iProver_def),X0) = or(and(p,sP0_iProver_def),X0),
    inference(superposition,[status(thm)],[c_712,c_57]) ).

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

cnf(c_1660,plain,
    theorem(or(X0,or(sP0_iProver_def,p))),
    inference(superposition,[status(thm)],[c_428,c_380]) ).

cnf(c_1661,plain,
    theorem(or(X0,or(sP1_iProver_def,sP0_iProver_def))),
    inference(superposition,[status(thm)],[c_461,c_380]) ).

cnf(c_1808,plain,
    theorem(or(sP0_iProver_def,p)),
    inference(superposition,[status(thm)],[c_1660,c_377]) ).

cnf(c_1842,plain,
    theorem(or(p,sP0_iProver_def)),
    inference(superposition,[status(thm)],[c_1808,c_379]) ).

cnf(c_1846,plain,
    theorem(or(sP1_iProver_def,sP0_iProver_def)),
    inference(superposition,[status(thm)],[c_1661,c_377]) ).

cnf(c_1854,plain,
    theorem(or(sP0_iProver_def,sP1_iProver_def)),
    inference(superposition,[status(thm)],[c_1846,c_379]) ).

cnf(c_2451,plain,
    ( ~ theorem(or(sP1_iProver_def,X0))
    | theorem(implies(or(X1,sP0_iProver_def),or(X1,X0))) ),
    inference(superposition,[status(thm)],[c_496,c_59]) ).

cnf(c_5612,plain,
    ( ~ theorem(or(and(p,sP0_iProver_def),X0))
    | ~ theorem(or(sP0_iProver_def,sP1_iProver_def))
    | theorem(X0) ),
    inference(superposition,[status(thm)],[c_1042,c_59]) ).

cnf(c_5623,plain,
    not(or(and(p,sP0_iProver_def),not(X0))) = and(or(sP0_iProver_def,sP1_iProver_def),X0),
    inference(superposition,[status(thm)],[c_1042,c_105]) ).

cnf(c_5712,plain,
    ( ~ theorem(or(and(p,sP0_iProver_def),X0))
    | theorem(X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_5612,c_1854]) ).

cnf(c_8680,plain,
    theorem(or(X0,implies(X1,X1))),
    inference(superposition,[status(thm)],[c_124,c_665]) ).

cnf(c_9188,plain,
    theorem(implies(X0,X0)),
    inference(superposition,[status(thm)],[c_8680,c_5712]) ).

cnf(c_9210,plain,
    theorem(or(X0,implies(or(X0,X1),X1))),
    inference(superposition,[status(thm)],[c_9188,c_665]) ).

cnf(c_9211,plain,
    theorem(implies(X0,not(not(X0)))),
    inference(superposition,[status(thm)],[c_9188,c_1412]) ).

cnf(c_9306,plain,
    theorem(or(sP1_iProver_def,not(not(sP0_iProver_def)))),
    inference(superposition,[status(thm)],[c_355,c_9211]) ).

cnf(c_9331,plain,
    theorem(or(sP1_iProver_def,not(sP1_iProver_def))),
    inference(light_normalisation,[status(thm)],[c_9306,c_189]) ).

cnf(c_10018,plain,
    theorem(implies(or(and(p,sP0_iProver_def),X0),X0)),
    inference(superposition,[status(thm)],[c_9210,c_5712]) ).

cnf(c_10686,plain,
    theorem(implies(X0,not(or(and(p,sP0_iProver_def),not(X0))))),
    inference(superposition,[status(thm)],[c_10018,c_1412]) ).

cnf(c_10691,plain,
    theorem(implies(X0,and(or(sP0_iProver_def,sP1_iProver_def),X0))),
    inference(light_normalisation,[status(thm)],[c_10686,c_5623]) ).

cnf(c_10932,plain,
    theorem(implies(implies(sP1_iProver_def,p),equivalent(p,sP1_iProver_def))),
    inference(superposition,[status(thm)],[c_423,c_10691]) ).

cnf(c_10936,plain,
    theorem(implies(implies(sP1_iProver_def,p),sP2_iProver_def)),
    inference(light_normalisation,[status(thm)],[c_10932,c_190]) ).

cnf(c_10949,plain,
    ( ~ theorem(implies(sP1_iProver_def,p))
    | theorem(sP2_iProver_def) ),
    inference(superposition,[status(thm)],[c_10936,c_59]) ).

cnf(c_10950,plain,
    ~ theorem(implies(sP1_iProver_def,p)),
    inference(forward_subsumption_resolution,[status(thm)],[c_10949,c_191]) ).

cnf(c_21419,plain,
    ( ~ theorem(or(X0,sP0_iProver_def))
    | ~ theorem(or(sP1_iProver_def,X1))
    | theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_2451,c_59]) ).

cnf(c_42138,plain,
    ( ~ theorem(or(sP1_iProver_def,X0))
    | theorem(or(p,X0)) ),
    inference(superposition,[status(thm)],[c_1842,c_21419]) ).

cnf(c_43134,plain,
    theorem(or(p,not(sP1_iProver_def))),
    inference(superposition,[status(thm)],[c_9331,c_42138]) ).

cnf(c_43321,plain,
    theorem(implies(sP1_iProver_def,p)),
    inference(superposition,[status(thm)],[c_43134,c_520]) ).

cnf(c_43322,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_43321,c_10950]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL265-3 : TPTP v8.2.0. Released v2.3.0.
% 0.07/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.32  % Computer : n017.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Sat Jun 22 13:34:24 EDT 2024
% 0.12/0.32  % CPUTime  : 
% 0.19/0.45  Running first-order theorem proving
% 0.19/0.45  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
% 13.92/2.66  % SZS status Started for theBenchmark.p
% 13.92/2.66  % SZS status Unsatisfiable for theBenchmark.p
% 13.92/2.66  
% 13.92/2.66  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 13.92/2.66  
% 13.92/2.66  ------  iProver source info
% 13.92/2.66  
% 13.92/2.66  git: date: 2024-06-12 09:56:46 +0000
% 13.92/2.66  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 13.92/2.66  git: non_committed_changes: false
% 13.92/2.66  
% 13.92/2.66  ------ Parsing...successful
% 13.92/2.66  
% 13.92/2.66  
% 13.92/2.66  
% 13.92/2.66  ------ Preprocessing... sup_sim: 1  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 
% 13.92/2.66  
% 13.92/2.66  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 13.92/2.66  
% 13.92/2.66  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 13.92/2.66  ------ Proving...
% 13.92/2.66  ------ Problem Properties 
% 13.92/2.66  
% 13.92/2.66  
% 13.92/2.66  clauses                                 13
% 13.92/2.66  conjectures                             1
% 13.92/2.66  EPR                                     1
% 13.92/2.66  Horn                                    13
% 13.92/2.66  unary                                   12
% 13.92/2.66  binary                                  0
% 13.92/2.66  lits                                    15
% 13.92/2.66  lits eq                                 6
% 13.92/2.66  fd_pure                                 0
% 13.92/2.66  fd_pseudo                               0
% 13.92/2.66  fd_cond                                 0
% 13.92/2.66  fd_pseudo_cond                          0
% 13.92/2.66  AC symbols                              0
% 13.92/2.66  
% 13.92/2.66  ------ Schedule dynamic 5 is on 
% 13.92/2.66  
% 13.92/2.66  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 13.92/2.66  
% 13.92/2.66  
% 13.92/2.66  ------ 
% 13.92/2.66  Current options:
% 13.92/2.66  ------ 
% 13.92/2.66  
% 13.92/2.66  
% 13.92/2.66  
% 13.92/2.66  
% 13.92/2.66  ------ Proving...
% 13.92/2.66  
% 13.92/2.66  
% 13.92/2.66  % SZS status Unsatisfiable for theBenchmark.p
% 13.92/2.66  
% 13.92/2.66  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 13.92/2.66  
% 13.92/2.66  
%------------------------------------------------------------------------------