↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM840+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:26:51 PM UTC 2026

% Result   : Theorem 3.53s 1.31s
% Output   : CNFRefutation 3.53s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f2ERROR: Could not build tree for root c_1200ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    less(vplus(vd328,vd330),vplus(vd329,vd330)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(conjunct2(conjunct2(204))), 335, 0)') ).

fof(f4,axiom,
    ( vplus(vd328,vd330) = vplus(vd329,vd330)
   => vd328 = vd329 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(conjunct1(conjunct2(204)), 0), 0)') ).

fof(f5,axiom,
    ( greater(vplus(vd328,vd330),vplus(vd329,vd330))
   => greater(vd328,vd329) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(conjunct1(204), 0), 0)') ).

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( less(X0,X1)
     => less(vplus(X0,X2),vplus(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 0)') ).

fof(f7,axiom,
    ! [X0,X1,X2] :
      ( X0 = X1
     => vplus(X0,X2) = vplus(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 1)') ).

fof(f8,axiom,
    ! [X0,X1,X2] :
      ( greater(X0,X1)
     => greater(vplus(X0,X2),vplus(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 2)') ).

fof(f9,axiom,
    ! [X0,X1] : greater(vplus(X0,X1),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(189, 0), 0)') ).

fof(f10,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X0,X1)
        & leq(X1,X2) )
     => leq(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(184, 0), 0)') ).

fof(f11,axiom,
    ! [X0,X1,X2] :
      ( ( ( less(X0,X1)
          & leq(X1,X2) )
        | ( leq(X0,X1)
          & less(X1,X2) ) )
     => less(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(177), 0), 0)') ).

fof(f12,axiom,
    ! [X0,X1,X2] :
      ( ( less(X0,X1)
        & less(X1,X2) )
     => less(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).

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

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

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

fof(f16,axiom,
    ! [X0,X1] :
      ( geq(X1,X0)
    <=> ( X1 = X0
        | greater(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).

fof(f17,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
     => greater(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).

fof(f18,axiom,
    ! [X0,X1] :
      ( greater(X0,X1)
     => less(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).

fof(f19,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
      | greater(X0,X1)
      | X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).

fof(f20,axiom,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | X0 != X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).

fof(f21,axiom,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | ~ greater(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).

fof(f22,axiom,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | X0 != X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 3)') ).

fof(f23,axiom,
    ! [X0,X1] :
      ( less(X1,X0)
    <=> ? [X2] : X0 = vplus(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).

fof(f24,axiom,
    ! [X0,X1] :
      ( greater(X1,X0)
    <=> ? [X2] : X1 = vplus(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).

fof(f25,axiom,
    ! [X0,X1] :
      ( ? [X3] : X1 = vplus(X0,X3)
      | ? [X2] : X0 = vplus(X1,X2)
      | X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 0)') ).

fof(f26,axiom,
    ! [X0,X1] :
      ( ~ ? [X2] : X1 = vplus(X0,X2)
      | X0 != X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).

fof(f27,axiom,
    ! [X0,X1] :
      ( ~ ? [X3] : X1 = vplus(X0,X3)
      | ~ ? [X2] : X0 = vplus(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 2)') ).

fof(f28,axiom,
    ! [X0,X1] :
      ( ~ ? [X2] : X0 = vplus(X1,X2)
      | X0 != X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 3)') ).

fof(f29,axiom,
    ! [X0,X1] :
      ( X0 != X1
     => ! [X2] : vplus(X2,X0) != vplus(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(81, 0), 0)') ).

fof(f30,axiom,
    ! [X0,X1] : X1 != vplus(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(73, 0), 0)') ).

fof(f31,axiom,
    ! [X0,X1] : vplus(X1,X0) = vplus(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).

fof(f32,axiom,
    ! [X0,X1] : vplus(vsucc(X0),X1) = vsucc(vplus(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(52, 0), 0)') ).

fof(f33,axiom,
    ! [X0] : vplus(v1,X0) = vsucc(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(43, 0), 0)') ).

fof(f34,axiom,
    ! [X0,X1,X2] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).

fof(f35,axiom,
    ! [X0,X1] :
      ( vplus(X0,v1) = vsucc(X0)
      & vplus(X0,vsucc(X1)) = vsucc(vplus(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).

fof(f36,axiom,
    ! [X0] :
      ( X0 != v1
     => X0 = vsucc(vskolem2(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(20, 0), 0)') ).

fof(f37,axiom,
    ! [X0] : vsucc(X0) != X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(12, 0), 0)') ).

fof(f38,axiom,
    ! [X0,X1] :
      ( X0 != X1
     => vsucc(X0) != vsucc(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(6, 0), 0)') ).

fof(f39,axiom,
    ! [X0,X1] :
      ( vsucc(X0) = vsucc(X1)
     => X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(antec(axiom(3)), imp(antec(axiom(3))))') ).

fof(f40,axiom,
    ! [X0] : vsucc(X0) != v1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(restrictor(axiom(1)), holds(scope(axiom(1)), 2, 0))') ).

fof(f41,plain,
    ~ less(vd328,vd329),
    inference(flattening,[],[f2]) ).

fof(f46,plain,
    ! [X0,X1,X2] :
      ( ~ greater(X0,X1)
      | greater(vplus(X0,X2),vplus(X1,X2)) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f74,plain,
    ~ less(vd328,vd329),
    inference(cnf_transformation,[],[f41]) ).

fof(f75,plain,
    less(vplus(vd328,vd330),vplus(vd329,vd330)),
    inference(cnf_transformation,[],[f3]) ).

fof(f80,plain,
    ! [X2,X0,X1] :
      ( ~ greater(X0,X1)
      | greater(vplus(X0,X2),vplus(X1,X2)) ),
    inference(cnf_transformation,[],[f46]) ).

fof(f96,plain,
    ! [X0,X1] :
      ( less(X0,X1)
      | greater(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f19]) ).

fof(f97,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f20]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | ~ greater(X0,X1) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f132,plain,
    ! [X1] : ~ less(X1,X1),
    inference(equality_resolution,[],[f97]) ).

tcf(c_49,negated_conjecture,
    ~ less(vd328,vd329),
    inference(cnf_transformation,[],[f74]) ).

tcf(c_50,plain,
    less(vplus(vd328,vd330),vplus(vd329,vd330)),
    inference(cnf_transformation,[],[f75]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( greater(vplus(X0,X2),vplus(X1,X2))
      | ~ greater(X0,X1) ),
    inference(cnf_transformation,[],[f80]) ).

tcf(c_70,plain,
    ! [X0: $i,X1: $i] :
      ( greater(X0,X1)
      | less(X0,X1)
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f96]) ).

tcf(c_71,plain,
    ! [X0: $i] : ~ less(X0,X0),
    inference(cnf_transformation,[],[f132]) ).

tcf(c_72,plain,
    ! [X0: $i,X1: $i] :
      ( ~ greater(X0,X1)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f98]) ).

tcf(c_616,negated_conjecture,
    ~ less(vd328,vd329),
    inference(demodulation,[status(thm)],[c_49]) ).

tcf(c_964,plain,
    ~ greater(vplus(vd328,vd330),vplus(vd329,vd330)),
    inference(superposition,[status(thm)],[c_50,c_72]) ).

tcf(c_1152,plain,
    ~ greater(vd328,vd329),
    inference(superposition,[status(thm)],[c_54,c_964]) ).

tcf(c_1192,plain,
    ( less(vd328,vd329)
    | ( vd328 = vd329 ) ),
    inference(superposition,[status(thm)],[c_70,c_1152]) ).

tcf(c_1193,plain,
    vd328 = vd329,
    inference(forward_subsumption_resolution,[status(thm)],[c_1192,c_616]) ).

tcf(c_1198,plain,
    less(vplus(vd328,vd330),vplus(vd328,vd330)),
    inference(demodulation,[status(thm)],[c_50,c_1193]) ).

tcf(c_1200,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1198,c_71]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM840+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.34  % Computer : n019.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Thu Sep 24 05:32:49 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.41  Running first-order theorem proving
% 0.13/0.41  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.43  
% 0.13/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43  
% 0.13/0.43  % Detected problem language: tptp
% 0.13/0.44  % Proving...
% 3.53/1.31  % SZS status Started for theBenchmark.p
% 3.53/1.31  % SZS status Theorem for theBenchmark.p
% 3.53/1.31  
% 3.53/1.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.53/1.31  
% 3.53/1.31  % ------  iProver source info
% 3.53/1.31  
% 3.53/1.31  % git: date: 2026-07-19 20:42:38 +0200
% 3.53/1.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.53/1.31  % git: non_committed_changes: false
% 3.53/1.31  
% 3.53/1.31  % ------ Parsing...
% 3.53/1.31  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.53/1.31  
% 3.53/1.31  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 3.53/1.31  
% 3.53/1.31  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.53/1.31  
% 3.53/1.31  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.53/1.31  % ------ Proving...
% 3.53/1.31  % ------ Problem Properties 
% 3.53/1.31  
% 3.53/1.31  % 
% 3.53/1.31  % clauses                               32
% 3.53/1.31  % conjectures                           1
% 3.53/1.31  % EPR                                   16
% 3.53/1.31  % Horn                                  27
% 3.53/1.31  % unary                                 11
% 3.53/1.31  % binary                                13
% 3.53/1.31  % lits                                  61
% 3.53/1.31  % lits eq                               18
% 3.53/1.31  % fd_pure                               0
% 3.53/1.31  % fd_pseudo                             0
% 3.53/1.31  % fd_cond                               0
% 3.53/1.31  % fd_pseudo_cond                        4
% 3.53/1.31  % AC symbols                            1
% 3.53/1.31  
% 3.53/1.31  % ------ Schedule dynamic 5 is on 
% 3.53/1.31  
% 3.53/1.31  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.53/1.31  
% 3.53/1.31  
% 3.53/1.31  % ------ 
% 3.53/1.31  % Current options:
% 3.53/1.31  % ------ 
% 3.53/1.31  
% 3.53/1.31  
% 3.53/1.31  % 
% 3.53/1.31  
% 3.53/1.31  % ------ Proving...
% 3.53/1.31  % 
% 3.53/1.31  
% 3.53/1.31  % SZS status Theorem for theBenchmark.p
% 3.53/1.31  
% 3.53/1.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.53/1.31  
% 3.53/1.31  
%------------------------------------------------------------------------------