TSTP Solution File: NUM843+2 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : NUM843+2 : TPTP v8.1.2. Released v4.1.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 : Fri May  3 02:50:52 EDT 2024

% Result   : Theorem 2.82s 0.98s
% Output   : CNFRefutation 2.82s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f135)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ~ greater(vd390,vd391),
    inference(cnf_transformation,[],[f134]) ).

cnf(c_50,plain,
    ~ leq(vd390,vd391),
    inference(cnf_transformation,[],[f135]) ).

cnf(c_74,plain,
    ( ~ greater(X0,X1)
    | geq(X0,X1) ),
    inference(cnf_transformation,[],[f160]) ).

cnf(c_76,plain,
    ( ~ less(X0,X1)
    | greater(X1,X0) ),
    inference(cnf_transformation,[],[f162]) ).

cnf(c_77,plain,
    ( ~ greater(X0,X1)
    | less(X1,X0) ),
    inference(cnf_transformation,[],[f163]) ).

cnf(c_78,plain,
    ( X0 = X1
    | greater(X0,X1)
    | less(X0,X1) ),
    inference(cnf_transformation,[],[f164]) ).

cnf(c_753,negated_conjecture,
    ~ greater(vd390,vd391),
    inference(demodulation,[status(thm)],[c_49]) ).

cnf(c_1343,plain,
    ( X0 = X1
    | greater(X0,X1)
    | greater(X1,X0) ),
    inference(superposition,[status(thm)],[c_78,c_76]) ).

cnf(c_1481,plain,
    ( vd390 = vd391
    | greater(vd391,vd390) ),
    inference(superposition,[status(thm)],[c_1343,c_753]) ).

cnf(c_1515,plain,
    ( vd390 = vd391
    | less(vd390,vd391) ),
    inference(superposition,[status(thm)],[c_1481,c_77]) ).

cnf(c_1516,plain,
    ( vd390 = vd391
    | geq(vd391,vd390) ),
    inference(superposition,[status(thm)],[c_1481,c_74]) ).

fof(f18,axiom,
    ! [X26,X27,X28] :
      ( ( ( less(X26,X27)
          & leq(X27,X28) )
        | ( leq(X26,X27)
          & less(X27,X28) ) )
     => less(X26,X28) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(177), 0), 0)') ).

fof(f152,plain,
    ! [X2,X0,X1] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ leq(X1,X2) ),
    inference(cnf_transformation,[],[f105]) ).

fof(f22,axiom,
    ! [X36,X37] :
      ( leq(X37,X36)
    <=> ( X36 = X37
        | less(X37,X36) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 17), 1)') ).

fof(f157,plain,
    ! [X0,X1] :
      ( leq(X1,X0)
      | ~ less(X1,X0) ),
    inference(cnf_transformation,[],[f120]) ).

fof(f61,plain,
    ! [X0,X1,X2] :
      ( ( ( less(X0,X1)
          & leq(X1,X2) )
        | ( leq(X0,X1)
          & less(X1,X2) ) )
     => less(X0,X2) ),
    inference(rectify,[],[f18]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( leq(X1,X0)
    <=> ( X0 = X1
        | less(X1,X0) ) ),
    inference(rectify,[],[f22]) ).

fof(f105,plain,
    ! [X0,X1,X2] :
      ( less(X0,X2)
      | ( ( ~ less(X0,X1)
          | ~ leq(X1,X2) )
        & ( ~ leq(X0,X1)
          | ~ less(X1,X2) ) ) ),
    inference(ennf_transformation,[],[f61]) ).

fof(f19,axiom,
    ! [X29,X30,X31] :
      ( ( less(X29,X30)
        & less(X30,X31) )
     => less(X29,X31) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).

fof(f151,plain,
    ! [X2,X0,X1] :
      ( less(X0,X2)
      | ~ leq(X0,X1)
      | ~ less(X1,X2) ),
    inference(cnf_transformation,[],[f105]) ).

fof(f62,plain,
    ! [X0,X1,X2] :
      ( ( less(X0,X1)
        & less(X1,X2) )
     => less(X0,X2) ),
    inference(rectify,[],[f19]) ).

fof(f106,plain,
    ! [X0,X1,X2] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ less(X1,X2) ),
    inference(ennf_transformation,[],[f62]) ).

fof(f107,plain,
    ! [X0,X1,X2] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ less(X1,X2) ),
    inference(flattening,[],[f106]) ).

fof(f20,axiom,
    ! [X32,X33] :
      ( leq(X32,X33)
     => geq(X33,X32) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(163, 0), 0)') ).

fof(f153,plain,
    ! [X2,X0,X1] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ less(X1,X2) ),
    inference(cnf_transformation,[],[f107]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
     => geq(X1,X0) ),
    inference(rectify,[],[f20]) ).

fof(f108,plain,
    ! [X0,X1] :
      ( geq(X1,X0)
      | ~ leq(X0,X1) ),
    inference(ennf_transformation,[],[f63]) ).

fof(f21,axiom,
    ! [X34,X35] :
      ( geq(X34,X35)
     => leq(X35,X34) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(158, 0), 0)') ).

fof(f154,plain,
    ! [X0,X1] :
      ( geq(X1,X0)
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[],[f108]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( geq(X0,X1)
     => leq(X1,X0) ),
    inference(rectify,[],[f21]) ).

fof(f109,plain,
    ! [X0,X1] :
      ( leq(X1,X0)
      | ~ geq(X0,X1) ),
    inference(ennf_transformation,[],[f64]) ).

fof(f119,plain,
    ! [X0,X1] :
      ( ( leq(X1,X0)
        | ( X0 != X1
          & ~ less(X1,X0) ) )
      & ( X0 = X1
        | less(X1,X0)
        | ~ leq(X1,X0) ) ),
    inference(nnf_transformation,[],[f65]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( ( leq(X1,X0)
        | ( X0 != X1
          & ~ less(X1,X0) ) )
      & ( X0 = X1
        | less(X1,X0)
        | ~ leq(X1,X0) ) ),
    inference(flattening,[],[f119]) ).

fof(f155,plain,
    ! [X0,X1] :
      ( leq(X1,X0)
      | ~ geq(X0,X1) ),
    inference(cnf_transformation,[],[f109]) ).

fof(f158,plain,
    ! [X0,X1] :
      ( leq(X1,X0)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f120]) ).

fof(f198,plain,
    ! [X1] : leq(X1,X1),
    inference(equality_resolution,[],[f158]) ).

cnf(c_69,plain,
    ( ~ geq(X0,X1)
    | leq(X1,X0) ),
    inference(cnf_transformation,[],[f155]) ).

cnf(c_70,plain,
    leq(X0,X0),
    inference(cnf_transformation,[],[f198]) ).

cnf(c_1548,plain,
    ( ~ geq(vd391,vd390)
    | leq(vd390,vd391) ),
    inference(instantiation,[status(thm)],[c_69]) ).

cnf(c_1747,plain,
    vd390 = vd391,
    inference(global_subsumption_just,[status(thm)],[c_1515,c_50,c_1516,c_1548]) ).

cnf(c_1754,plain,
    ~ leq(vd390,vd390),
    inference(demodulation,[status(thm)],[c_50,c_1747]) ).

cnf(c_1756,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1754,c_70]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : NUM843+2 : TPTP v8.1.2. Released v4.1.0.
% 0.02/0.10  % Command  : run_iprover %s %d THM
% 0.09/0.30  % Computer : n017.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Thu May  2 19:13:06 EDT 2024
% 0.09/0.30  % CPUTime  : 
% 0.14/0.37  Running first-order theorem proving
% 0.14/0.37  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
% 2.82/0.98  % SZS status Started for theBenchmark.p
% 2.82/0.98  % SZS status Theorem for theBenchmark.p
% 2.82/0.98  
% 2.82/0.98  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.82/0.98  
% 2.82/0.98  ------  iProver source info
% 2.82/0.98  
% 2.82/0.98  git: date: 2024-05-02 19:28:25 +0000
% 2.82/0.98  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.82/0.98  git: non_committed_changes: false
% 2.82/0.98  
% 2.82/0.98  ------ Parsing...
% 2.82/0.98  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.82/0.98  
% 2.82/0.98  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 2.82/0.98  
% 2.82/0.98  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.82/0.98  
% 2.82/0.98  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.82/0.98  ------ Proving...
% 2.82/0.98  ------ Problem Properties 
% 2.82/0.98  
% 2.82/0.98  
% 2.82/0.98  clauses                                 43
% 2.82/0.98  conjectures                             1
% 2.82/0.98  EPR                                     21
% 2.82/0.98  Horn                                    38
% 2.82/0.98  unary                                   14
% 2.82/0.98  binary                                  17
% 2.82/0.98  lits                                    84
% 2.82/0.98  lits eq                                 18
% 2.82/0.98  fd_pure                                 0
% 2.82/0.98  fd_pseudo                               0
% 2.82/0.98  fd_cond                                 0
% 2.82/0.98  fd_pseudo_cond                          5
% 2.82/0.98  AC symbols                              1
% 2.82/0.98  
% 2.82/0.98  ------ Schedule dynamic 5 is on 
% 2.82/0.98  
% 2.82/0.98  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.82/0.98  
% 2.82/0.98  
% 2.82/0.98  ------ 
% 2.82/0.98  Current options:
% 2.82/0.98  ------ 
% 2.82/0.98  
% 2.82/0.98  
% 2.82/0.98  
% 2.82/0.98  
% 2.82/0.98  ------ Proving...
% 2.82/0.98  
% 2.82/0.98  
% 2.82/0.98  % SZS status Theorem for theBenchmark.p
% 2.82/0.98  
% 2.82/0.98  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.82/0.98  
% 2.82/0.98  
%------------------------------------------------------------------------------