↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV067+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n014.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 03:16:20 PM UTC 2026

% Result   : Theorem 1.39s 1.29s
% Output   : CNFRefutation 1.39s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f383ERROR: Could not build tree for root c_16198ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X1,X2)
        & leq(X0,X1) )
     => leq(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( gt(X1,X0)
     => leq(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).

fof(f53,conjecture,
    ( ( leq(pv63,minus(n5,n1))
      & leq(pv10,minus(n135300,n1))
      & leq(n1,pv63)
      & leq(n0,pv10) )
   => ( ( gt(a_select3(q,pv10,pv63),pv78)
       => ( leq(pv10,minus(n135300,n1))
          & leq(n0,pv10) ) )
      & ( ~ gt(a_select3(q,pv10,pv63),pv78)
       => ( leq(pv10,minus(n135300,n1))
          & leq(n0,pv10) ) )
      & leq(pv63,minus(n5,n1))
      & leq(pv10,minus(n135300,n1))
      & leq(n0,pv63)
      & leq(n0,pv10) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0008) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(pv63,minus(n5,n1))
        & leq(pv10,minus(n135300,n1))
        & leq(n1,pv63)
        & leq(n0,pv10) )
     => ( ( gt(a_select3(q,pv10,pv63),pv78)
         => ( leq(pv10,minus(n135300,n1))
            & leq(n0,pv10) ) )
        & ( ~ gt(a_select3(q,pv10,pv63),pv78)
         => ( leq(pv10,minus(n135300,n1))
            & leq(n0,pv10) ) )
        & leq(pv63,minus(n5,n1))
        & leq(pv10,minus(n135300,n1))
        & leq(n0,pv63)
        & leq(n0,pv10) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f68,axiom,
    gt(n1,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).

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

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

fof(f107,plain,
    ! [X0,X1] :
      ( ~ gt(X1,X0)
      | leq(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f143,plain,
    ( leq(pv63,minus(n5,n1))
    & leq(pv10,minus(n135300,n1))
    & leq(n1,pv63)
    & leq(n0,pv10)
    & ( ( gt(a_select3(q,pv10,pv63),pv78)
        & ( ~ leq(pv10,minus(n135300,n1))
          | ~ leq(n0,pv10) ) )
      | ( ~ gt(a_select3(q,pv10,pv63),pv78)
        & ( ~ leq(pv10,minus(n135300,n1))
          | ~ leq(n0,pv10) ) )
      | ~ leq(pv63,minus(n5,n1))
      | ~ leq(pv10,minus(n135300,n1))
      | ~ leq(n0,pv63)
      | ~ leq(n0,pv10) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f144,plain,
    ( leq(pv63,minus(n5,n1))
    & leq(pv10,minus(n135300,n1))
    & leq(n1,pv63)
    & leq(n0,pv10)
    & ( ( gt(a_select3(q,pv10,pv63),pv78)
        & ( ~ leq(pv10,minus(n135300,n1))
          | ~ leq(n0,pv10) ) )
      | ( ~ gt(a_select3(q,pv10,pv63),pv78)
        & ( ~ leq(pv10,minus(n135300,n1))
          | ~ leq(n0,pv10) ) )
      | ~ leq(pv63,minus(n5,n1))
      | ~ leq(pv10,minus(n135300,n1))
      | ~ leq(n0,pv63)
      | ~ leq(n0,pv10) ) ),
    inference(flattening,[],[f143]) ).

fof(f201,plain,
    ! [X2,X0,X1] :
      ( ~ leq(X1,X2)
      | ~ leq(X0,X1)
      | leq(X0,X2) ),
    inference(cnf_transformation,[],[f106]) ).

fof(f202,plain,
    ! [X0,X1] :
      ( ~ gt(X1,X0)
      | leq(X0,X1) ),
    inference(cnf_transformation,[],[f107]) ).

fof(f307,plain,
    leq(pv63,minus(n5,n1)),
    inference(cnf_transformation,[],[f144]) ).

fof(f308,plain,
    leq(pv10,minus(n135300,n1)),
    inference(cnf_transformation,[],[f144]) ).

fof(f309,plain,
    leq(n1,pv63),
    inference(cnf_transformation,[],[f144]) ).

fof(f310,plain,
    leq(n0,pv10),
    inference(cnf_transformation,[],[f144]) ).

fof(f328,plain,
    gt(n1,n0),
    inference(cnf_transformation,[],[f68]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( leq(X0,X2)
      | ~ leq(X1,X2)
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[],[f201]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i] :
      ( leq(X1,X0)
      | ~ gt(X0,X1) ),
    inference(cnf_transformation,[],[f202]) ).

tcf(c_157,negated_conjecture,
    ( ~ leq(n0,pv63)
    | ~ leq(n0,pv10)
    | ~ leq(pv63,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1)) ),
    inference(cnf_transformation,[],[f383]) ).

tcf(c_160,negated_conjecture,
    leq(n0,pv10),
    inference(cnf_transformation,[],[f310]) ).

tcf(c_161,negated_conjecture,
    leq(n1,pv63),
    inference(cnf_transformation,[],[f309]) ).

tcf(c_162,negated_conjecture,
    leq(pv10,minus(n135300,n1)),
    inference(cnf_transformation,[],[f308]) ).

tcf(c_163,negated_conjecture,
    leq(pv63,minus(n5,n1)),
    inference(cnf_transformation,[],[f307]) ).

tcf(c_177,plain,
    gt(n1,n0),
    inference(cnf_transformation,[],[f328]) ).

tcf(c_14159,plain,
    leq(n0,n1),
    inference(superposition,[status(thm)],[c_177,c_54]) ).

tcf(c_15561,plain,
    ! [X0: $i] :
      ( leq(n0,pv63)
      | ~ leq(n0,X0)
      | ~ leq(X0,pv63) ),
    inference(instantiation,[status(thm)],[c_53]) ).

tcf(c_16197,plain,
    ( leq(n0,pv63)
    | ~ leq(n0,n1)
    | ~ leq(n1,pv63) ),
    inference(instantiation,[status(thm)],[c_15561]) ).

tcf(c_16198,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_16197,c_14159,c_157,c_162,c_163,c_160,c_161]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV067+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37  % Computer : n014.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Thu Sep 24 18:25:47 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.42  
% 0.11/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42  
% 0.11/0.42  % Detected problem language: tptp
% 0.11/0.44  % Proving...
% 1.39/1.29  % SZS status Started for theBenchmark.p
% 1.39/1.29  % SZS status Theorem for theBenchmark.p
% 1.39/1.29  
% 1.39/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.39/1.29  
% 1.39/1.29  % ------  iProver source info
% 1.39/1.29  
% 1.39/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 1.39/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.39/1.29  % git: non_committed_changes: false
% 1.39/1.29  
% 1.39/1.29  % ------ Parsing...
% 1.39/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.39/1.29  
% 1.39/1.29  % ------ Preprocessing... sup_sim: 15  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 % 
% 1.39/1.29  
% 1.39/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.39/1.29  
% 1.39/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.39/1.29  % ------ Proving...
% 1.39/1.29  % ------ Problem Properties 
% 1.39/1.29  
% 1.39/1.29  % 
% 1.39/1.29  % clauses                               154
% 1.39/1.29  % conjectures                           5
% 1.39/1.29  % EPR                                   48
% 1.39/1.29  % Horn                                  104
% 1.39/1.29  % unary                                 60
% 1.39/1.29  % binary                                34
% 1.39/1.29  % lits                                  493
% 1.39/1.29  % lits eq                               115
% 1.39/1.29  % fd_pure                               0
% 1.39/1.29  % fd_pseudo                             0
% 1.39/1.29  % fd_cond                               6
% 1.39/1.29  % fd_pseudo_cond                        4
% 1.39/1.29  % AC symbols                            0
% 1.39/1.29  
% 1.39/1.29  % ------ Schedule dynamic 5 is on 
% 1.39/1.29  
% 1.39/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.39/1.29  
% 1.39/1.29  
% 1.39/1.29  % ------ 
% 1.39/1.29  % Current options:
% 1.39/1.29  % ------ 
% 1.39/1.29  
% 1.39/1.29  
% 1.39/1.29  % 
% 1.39/1.29  
% 1.39/1.29  % ------ Proving...
% 1.39/1.29  % 
% 1.39/1.29  
% 1.39/1.29  % SZS status Theorem for theBenchmark.p
% 1.39/1.29  
% 1.39/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.39/1.29  
% 1.39/1.29  
%------------------------------------------------------------------------------