↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : CSR019+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/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 01:09:54 PM UTC 2026

% Result   : Theorem 3.93s 1.43s
% Output   : CNFRefutation 3.93s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f70ERROR: Could not build tree for root c_6581ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X0,X1,X2] :
      ( ( terminates(X0,X2,X1)
        & happens(X0,X1) )
     => ~ holdsAt(X2,plus(X1,n1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).

fof(f25,axiom,
    plus(n1,n1) = n2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).

fof(f48,conjecture,
    ~ holdsAt(forwards,n2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_forwards_2) ).

fof(f49,negated_conjecture,
    ~ ~ holdsAt(forwards,n2),
    inference(negated_conjecture,[status(cth)],[f48]) ).

fof(f50,plain,
    holdsAt(forwards,n2),
    inference(flattening,[],[f49]) ).

fof(f52,plain,
    ! [X0,X1,X2] :
      ( ~ terminates(X0,X2,X1)
      | ~ happens(X0,X1)
      | ~ holdsAt(X2,plus(X1,n1)) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f53,plain,
    ! [X0,X1,X2] :
      ( ~ terminates(X0,X2,X1)
      | ~ happens(X0,X1)
      | ~ holdsAt(X2,plus(X1,n1)) ),
    inference(flattening,[],[f52]) ).

fof(f78,plain,
    ! [X0,X1,X2] :
      ( ( ~ sP5(X0,X1,X2)
        | sP0(X0,X1,X2)
        | sP1(X0,X1,X2)
        | sP2(X0,X1,X2)
        | sP3(X0,X1,X2)
        | sP4(X0,X1,X2)
        | ( ~ happens(pull,X2)
          & X1 = backwards
          & X0 = push ) )
      & ( ( ~ sP0(X0,X1,X2)
          & ~ sP1(X0,X1,X2)
          & ~ sP2(X0,X1,X2)
          & ~ sP3(X0,X1,X2)
          & ~ sP4(X0,X1,X2)
          & ( happens(pull,X2)
            | backwards != X1
            | push != X0 ) )
        | sP5(X0,X1,X2) ) ),
    inference(nnf_transformation,[],[f69]) ).

fof(f79,plain,
    ! [X0,X1,X2] :
      ( ( ~ sP5(X0,X1,X2)
        | sP0(X0,X1,X2)
        | sP1(X0,X1,X2)
        | sP2(X0,X1,X2)
        | sP3(X0,X1,X2)
        | sP4(X0,X1,X2)
        | ( ~ happens(pull,X2)
          & X1 = backwards
          & X0 = push ) )
      & ( ( ~ sP0(X0,X1,X2)
          & ~ sP1(X0,X1,X2)
          & ~ sP2(X0,X1,X2)
          & ~ sP3(X0,X1,X2)
          & ~ sP4(X0,X1,X2)
          & ( happens(pull,X2)
            | backwards != X1
            | push != X0 ) )
        | sP5(X0,X1,X2) ) ),
    inference(flattening,[],[f78]) ).

fof(f80,plain,
    ! [X0,X1,X2] :
      ( ( ~ sP4(X0,X1,X2)
        | ( ~ happens(push,X2)
          & X1 = forwards
          & X0 = pull ) )
      & ( happens(push,X2)
        | forwards != X1
        | pull != X0
        | sP4(X0,X1,X2) ) ),
    inference(nnf_transformation,[],[f68]) ).

fof(f81,plain,
    ! [X0,X1,X2] :
      ( ( ~ sP4(X0,X1,X2)
        | ( ~ happens(push,X2)
          & X1 = forwards
          & X0 = pull ) )
      & ( happens(push,X2)
        | forwards != X1
        | pull != X0
        | sP4(X0,X1,X2) ) ),
    inference(flattening,[],[f80]) ).

fof(f82,plain,
    ! [X0,X1,X2] :
      ( ( ~ sP3(X0,X1,X2)
        | ( happens(push,X2)
          & X1 = forwards
          & X0 = pull ) )
      & ( ~ happens(push,X2)
        | forwards != X1
        | pull != X0
        | sP3(X0,X1,X2) ) ),
    inference(nnf_transformation,[],[f67]) ).

fof(f83,plain,
    ! [X0,X1,X2] :
      ( ( ~ sP3(X0,X1,X2)
        | ( happens(push,X2)
          & X1 = forwards
          & X0 = pull ) )
      & ( ~ happens(push,X2)
        | forwards != X1
        | pull != X0
        | sP3(X0,X1,X2) ) ),
    inference(flattening,[],[f82]) ).

fof(f90,plain,
    ! [X0,X1,X2] :
      ( ( ~ terminates(X0,X1,X2)
        | sP5(X0,X1,X2) )
      & ( ~ sP5(X0,X1,X2)
        | terminates(X0,X1,X2) ) ),
    inference(nnf_transformation,[],[f70]) ).

fof(f106,plain,
    ! [X0,X1] :
      ( ( ~ sP9(X0,X1)
        | sP8(X0,X1)
        | ( X1 = n2
          & X0 = pull )
        | ( X1 = n1
          & X0 = pull )
        | ( X1 = n0
          & X0 = push ) )
      & ( ( ~ sP8(X0,X1)
          & ( n2 != X1
            | pull != X0 )
          & ( n1 != X1
            | pull != X0 )
          & ( n0 != X1
            | push != X0 ) )
        | sP9(X0,X1) ) ),
    inference(nnf_transformation,[],[f75]) ).

fof(f107,plain,
    ! [X0,X1] :
      ( ( ~ sP9(X0,X1)
        | sP8(X0,X1)
        | ( X1 = n2
          & X0 = pull )
        | ( X1 = n1
          & X0 = pull )
        | ( X1 = n0
          & X0 = push ) )
      & ( ( ~ sP8(X0,X1)
          & ( n2 != X1
            | pull != X0 )
          & ( n1 != X1
            | pull != X0 )
          & ( n0 != X1
            | push != X0 ) )
        | sP9(X0,X1) ) ),
    inference(flattening,[],[f106]) ).

fof(f110,plain,
    ! [X0,X1] :
      ( ( ~ happens(X0,X1)
        | sP9(X0,X1) )
      & ( ~ sP9(X0,X1)
        | happens(X0,X1) ) ),
    inference(nnf_transformation,[],[f76]) ).

fof(f115,plain,
    holdsAt(forwards,n2),
    inference(cnf_transformation,[],[f50]) ).

fof(f130,plain,
    ! [X2,X0,X1] :
      ( ~ sP3(X0,X1,X2)
      | sP5(X0,X1,X2) ),
    inference(cnf_transformation,[],[f79]) ).

fof(f131,plain,
    ! [X2,X0,X1] :
      ( ~ sP4(X0,X1,X2)
      | sP5(X0,X1,X2) ),
    inference(cnf_transformation,[],[f79]) ).

fof(f136,plain,
    ! [X2,X0,X1] :
      ( happens(push,X2)
      | forwards != X1
      | pull != X0
      | sP4(X0,X1,X2) ),
    inference(cnf_transformation,[],[f81]) ).

fof(f140,plain,
    ! [X2,X0,X1] :
      ( ~ happens(push,X2)
      | forwards != X1
      | pull != X0
      | sP3(X0,X1,X2) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f154,plain,
    ! [X2,X0,X1] :
      ( ~ sP5(X0,X1,X2)
      | terminates(X0,X1,X2) ),
    inference(cnf_transformation,[],[f90]) ).

fof(f169,plain,
    ! [X2,X0,X1] :
      ( ~ terminates(X0,X2,X1)
      | ~ happens(X0,X1)
      | ~ holdsAt(X2,plus(X1,n1)) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f185,plain,
    n2 = plus(n1,n1),
    inference(cnf_transformation,[],[f25]) ).

fof(f204,plain,
    ! [X0,X1] :
      ( n1 != X1
      | pull != X0
      | sP9(X0,X1) ),
    inference(cnf_transformation,[],[f107]) ).

fof(f210,plain,
    ! [X0,X1] :
      ( ~ sP9(X0,X1)
      | happens(X0,X1) ),
    inference(cnf_transformation,[],[f110]) ).

fof(f214,plain,
    ! [X2,X1] :
      ( happens(push,X2)
      | forwards != X1
      | sP4(pull,X1,X2) ),
    inference(equality_resolution,[],[f136]) ).

fof(f215,plain,
    ! [X2] :
      ( happens(push,X2)
      | sP4(pull,forwards,X2) ),
    inference(equality_resolution,[],[f214]) ).

fof(f216,plain,
    ! [X2,X1] :
      ( ~ happens(push,X2)
      | forwards != X1
      | sP3(pull,X1,X2) ),
    inference(equality_resolution,[],[f140]) ).

fof(f217,plain,
    ! [X2] :
      ( ~ happens(push,X2)
      | sP3(pull,forwards,X2) ),
    inference(equality_resolution,[],[f216]) ).

fof(f234,plain,
    ! [X1] :
      ( n1 != X1
      | sP9(pull,X1) ),
    inference(equality_resolution,[],[f204]) ).

fof(f235,plain,
    sP9(pull,n1),
    inference(equality_resolution,[],[f234]) ).

tcf(c_53,negated_conjecture,
    holdsAt(forwards,n2),
    inference(cnf_transformation,[],[f115]) ).

tcf(c_63,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( sP5(X0,X1,X2)
      | ~ sP4(X0,X1,X2) ),
    inference(cnf_transformation,[],[f131]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( sP5(X0,X1,X2)
      | ~ sP3(X0,X1,X2) ),
    inference(cnf_transformation,[],[f130]) ).

tcf(c_71,plain,
    ! [X0: $i] :
      ( happens(push,X0)
      | sP4(pull,forwards,X0) ),
    inference(cnf_transformation,[],[f215]) ).

tcf(c_75,plain,
    ! [X0: $i] :
      ( sP3(pull,forwards,X0)
      | ~ happens(push,X0) ),
    inference(cnf_transformation,[],[f217]) ).

tcf(c_91,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( terminates(X0,X1,X2)
      | ~ sP5(X0,X1,X2) ),
    inference(cnf_transformation,[],[f154]) ).

tcf(c_107,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ happens(X2,X1)
      | ~ terminates(X2,X0,X1)
      | ~ holdsAt(X0,plus(X1,n1)) ),
    inference(cnf_transformation,[],[f169]) ).

tcf(c_123,plain,
    plus(n1,n1) = n2,
    inference(cnf_transformation,[],[f185]) ).

tcf(c_133,plain,
    sP9(pull,n1),
    inference(cnf_transformation,[],[f235]) ).

tcf(c_147,plain,
    ! [X0: $i,X1: $i] :
      ( happens(X0,X1)
      | ~ sP9(X0,X1) ),
    inference(cnf_transformation,[],[f210]) ).

tcf(c_265,plain,
    ! [X0: $i,X1: $i] :
      ( happens(X0,X1)
      | ~ sP9(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_147]) ).

tcf(c_283,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( terminates(X0,X1,X2)
      | ~ sP4(X0,X1,X2) ),
    inference(prop_impl_just,[status(thm)],[c_91,c_63]) ).

tcf(c_291,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( terminates(X0,X1,X2)
      | ~ sP3(X0,X1,X2) ),
    inference(prop_impl_just,[status(thm)],[c_91,c_64]) ).

tcf(c_323,plain,
    ! [X0: $i] :
      ( sP3(pull,forwards,X0)
      | ~ happens(push,X0) ),
    inference(prop_impl_just,[status(thm)],[c_75]) ).

tcf(c_335,plain,
    ! [X0: $i] :
      ( sP4(pull,forwards,X0)
      | happens(push,X0) ),
    inference(prop_impl_just,[status(thm)],[c_71]) ).

tcf(c_336,plain,
    ! [X0: $i] :
      ( happens(push,X0)
      | sP4(pull,forwards,X0) ),
    inference(renaming,[status(thm)],[c_335]) ).

tcf(c_2403,plain,
    ! [X0: $i,X1: $i] :
      ( happens(X1,X0)
      | ( X1 != pull )
      | ( X0 != n1 ) ),
    inference(resolution_lifted,[status(thm)],[c_133,c_265]) ).

tcf(c_2404,plain,
    happens(pull,n1),
    inference(unflattening,[status(thm)],[c_2403]) ).

tcf(c_2631,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( happens(push,X3)
      | terminates(X0,X1,X2)
      | ( X2 != X3 )
      | ( X1 != forwards )
      | ( X0 != pull ) ),
    inference(resolution_lifted,[status(thm)],[c_283,c_336]) ).

tcf(c_2632,plain,
    ! [X0: $i] :
      ( happens(push,X0)
      | terminates(pull,forwards,X0) ),
    inference(unflattening,[status(thm)],[c_2631]) ).

tcf(c_2950,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( terminates(X0,X1,X2)
      | ~ happens(push,X3)
      | ( X2 != X3 )
      | ( X1 != forwards )
      | ( X0 != pull ) ),
    inference(resolution_lifted,[status(thm)],[c_291,c_323]) ).

tcf(c_2951,plain,
    ! [X0: $i] :
      ( terminates(pull,forwards,X0)
      | ~ happens(push,X0) ),
    inference(unflattening,[status(thm)],[c_2950]) ).

tcf(c_2953,plain,
    ! [X0: $i] : terminates(pull,forwards,X0),
    inference(global_subsumption_just,[status(thm)],[c_2951,c_2632,c_2951]) ).

tcf(c_6102,plain,
    ! [X0: $i,X1: $i] :
      ( ~ happens(X0,n1)
      | ~ holdsAt(X1,n2)
      | ~ terminates(X0,X1,n1) ),
    inference(superposition,[status(thm)],[c_123,c_107]) ).

tcf(c_6579,plain,
    ( ~ happens(pull,n1)
    | ~ holdsAt(forwards,n2) ),
    inference(superposition,[status(thm)],[c_2953,c_6102]) ).

tcf(c_6581,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_6579,c_2404,c_53]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR019+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.45  % Computer : n014.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Fri Sep 25 08:07:04 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.22/0.52  Running first-order theorem proving
% 0.22/0.52  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.22/0.53  
% 0.22/0.53  % ======== iProver multi-core TPTP/SMT =========
% 0.22/0.53  
% 0.22/0.54  % Detected problem language: tptp
% 0.22/0.56  % Proving...
% 3.93/1.43  % SZS status Started for theBenchmark.p
% 3.93/1.43  % SZS status Theorem for theBenchmark.p
% 3.93/1.43  
% 3.93/1.43  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.93/1.43  
% 3.93/1.43  % ------  iProver source info
% 3.93/1.43  
% 3.93/1.43  % git: date: 2026-07-19 20:42:38 +0200
% 3.93/1.43  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.93/1.43  % git: non_committed_changes: false
% 3.93/1.43  
% 3.93/1.43  % ------ Parsing...
% 3.93/1.43  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.93/1.43  
% 3.93/1.43  % ------ Preprocessing... sup_sim: 1  sf_s  rm: 2 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e  sup_sim: 0  sf_s  rm: 10 0s  sf_e  pe_s  pe_e % 
% 3.93/1.43  
% 3.93/1.43  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.93/1.43  
% 3.93/1.43  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.93/1.43  % ------ Proving...
% 3.93/1.43  % ------ Problem Properties 
% 3.93/1.43  
% 3.93/1.43  % 
% 3.93/1.43  % clauses                               72
% 3.93/1.43  % conjectures                           1
% 3.93/1.43  % EPR                                   59
% 3.93/1.43  % Horn                                  46
% 3.93/1.43  % unary                                 27
% 3.93/1.43  % binary                                20
% 3.93/1.43  % lits                                  158
% 3.93/1.43  % lits eq                               54
% 3.93/1.43  % fd_pure                               0
% 3.93/1.43  % fd_pseudo                             0
% 3.93/1.43  % fd_cond                               21
% 3.93/1.43  % fd_pseudo_cond                        1
% 3.93/1.43  % AC symbols                            0
% 3.93/1.43  
% 3.93/1.43  % ------ Schedule dynamic 5 is on 
% 3.93/1.43  
% 3.93/1.43  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.93/1.43  
% 3.93/1.43  
% 3.93/1.43  % ------ 
% 3.93/1.43  % Current options:
% 3.93/1.43  % ------ 
% 3.93/1.43  
% 3.93/1.43  
% 3.93/1.43  % 
% 3.93/1.43  
% 3.93/1.43  % ------ Proving...
% 3.93/1.43  % 
% 3.93/1.43  
% 3.93/1.43  % SZS status Theorem for theBenchmark.p
% 3.93/1.43  
% 3.93/1.43  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.93/1.43  
%------------------------------------------------------------------------------