↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n005.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:55 PM UTC 2026

% Result   : Unsatisfiable 30.58s 5.72s
% Output   : CNFRefutation 30.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   24 (  14 unt;   0 def)
%            Number of atoms       :   38 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  12   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-3 aty)
%            Number of variables   :   32 (   0 sgn  32   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f79,axiom,
    ! [X0] : c_less(X0,c_Suc(X0),tc_nat),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Nat_OlessI_0) ).

fof(f82,axiom,
    ! [X0,X1] :
      ( c_lessequals(X1,X1,X0)
      | ~ class_Orderings_Oorder(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Orderings_Oorder__class_Oaxioms__1_0) ).

fof(f243,axiom,
    class_Orderings_Oorder(tc_nat),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsarity_nat_3) ).

fof(f2432,axiom,
    ! [X0,X1] : ~ c_less(c_plus(X0,X1,tc_nat),X1,tc_nat),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_Onot__add__less2_0) ).

fof(f3054,axiom,
    ! [X0] : c_Finite__Set_Ocard(c_SetInterval_OatMost(X0,tc_nat),tc_nat) = c_Suc(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_Ocard__atMost_0) ).

fof(f3055,plain,
    ! [X0] : c_Suc(X0) = c_Finite__Set_Ocard(c_SetInterval_OatMost(X0,tc_nat),tc_nat),
    inference(reorient_equations,[],[f3054]) ).

fof(f3558,axiom,
    ! [X0,X1] : c_lessequals(X0,c_plus(X0,X1,tc_nat),tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Ole__add1_0) ).

fof(f3562,axiom,
    ! [X0,X1] :
      ( ~ c_lessequals(v_sko__urX(X1),X0,tc_nat)
      | ~ c_in(c_Message_Omsg_ONonce(X0),c_Event_Oused(X1),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Public_ONonce__supply__lemma_0) ).

fof(f3563,negated_conjecture,
    ! [X0,X1] :
      ( c_in(c_Message_Omsg_ONonce(X0),c_Event_Oused(v_evs),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg)
      | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f3568,plain,
    ! [X0] : c_less(X0,c_Finite__Set_Ocard(c_SetInterval_OatMost(X0,tc_nat),tc_nat),tc_nat),
    inference(definition_unfolding,[],[f79,f3055]) ).

tcf(c_3050,plain,
    ! [X0: $i] : c_less(X0,c_Finite__Set_Ocard(c_SetInterval_OatMost(X0,tc_nat),tc_nat),tc_nat),
    inference(cnf_transformation,[],[f3568]) ).

tcf(c_3053,plain,
    ! [X0: $i,X1: $i] :
      ( c_lessequals(X1,X1,X0)
      | ~ class_Orderings_Oorder(X0) ),
    inference(cnf_transformation,[],[f82]) ).

tcf(c_3185,plain,
    class_Orderings_Oorder(tc_nat),
    inference(cnf_transformation,[],[f243]) ).

tcf(c_4586,negated_conjecture,
    ! [X0: $i,X1: $i] : ~ c_less(c_plus(X0,X1,tc_nat),X1,tc_nat),
    inference(cnf_transformation,[],[f2432]) ).

tcf(c_5322,plain,
    ! [X0: $i,X1: $i] : c_lessequals(X0,c_plus(X0,X1,tc_nat),tc_nat),
    inference(cnf_transformation,[],[f3558]) ).

tcf(c_5326,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ c_lessequals(v_sko__urX(X1),X0,tc_nat)
      | ~ c_in(c_Message_Omsg_ONonce(X0),c_Event_Oused(X1),tc_Message_Omsg) ),
    inference(cnf_transformation,[],[f3562]) ).

tcf(c_5327,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(X0),c_Event_Oused(v_evs),tc_Message_Omsg)
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f3563]) ).

tcf(c_10115,plain,
    ! [X0: $i,X1: $i] :
      ( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg)
      | ( X0 = X1 )
      | ~ c_lessequals(v_sko__urX(v_evs),X0,tc_nat) ),
    inference(superposition,[status(thm)],[c_5327,c_5326]) ).

tcf(c_11080,plain,
    ! [X0: $i] :
      ( c_in(c_Message_Omsg_ONonce(X0),c_Event_Oused(v_evs_H),tc_Message_Omsg)
      | ( v_sko__urX(v_evs) = X0 )
      | ~ class_Orderings_Oorder(tc_nat) ),
    inference(superposition,[status(thm)],[c_3053,c_10115]) ).

tcf(c_11109,plain,
    ! [X0: $i] :
      ( c_in(c_Message_Omsg_ONonce(X0),c_Event_Oused(v_evs_H),tc_Message_Omsg)
      | ( v_sko__urX(v_evs) = X0 ) ),
    inference(global_subsumption_just,[status(thm)],[c_11080,c_3185,c_11080]) ).

tcf(c_11112,plain,
    ! [X0: $i] :
      ( ( v_sko__urX(v_evs) = X0 )
      | ~ c_lessequals(v_sko__urX(v_evs_H),X0,tc_nat) ),
    inference(superposition,[status(thm)],[c_11109,c_5326]) ).

tcf(c_11251,plain,
    ! [X0: $i] : c_plus(v_sko__urX(v_evs_H),X0,tc_nat) = v_sko__urX(v_evs),
    inference(superposition,[status(thm)],[c_5322,c_11112]) ).

tcf(c_11290,plain,
    ! [X0: $i] : ~ c_less(v_sko__urX(v_evs),X0,tc_nat),
    inference(superposition,[status(thm)],[c_11251,c_4586]) ).

tcf(c_11346,plain,
    $false,
    inference(superposition,[status(thm)],[c_3050,c_11290]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV281-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37  % Computer : n005.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Thu Sep 24 19:00:32 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  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.10/0.43  
% 0.10/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43  
% 0.10/0.43  % Detected problem language: tptp
% 0.10/0.44  % Proving...
% 30.58/5.72  % SZS status Started for theBenchmark.p
% 30.58/5.72  % SZS status Unsatisfiable for theBenchmark.p
% 30.58/5.72  
% 30.58/5.72  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 30.58/5.72  
% 30.58/5.72  % ------  iProver source info
% 30.58/5.72  
% 30.58/5.72  % git: date: 2026-07-19 20:42:38 +0200
% 30.58/5.72  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 30.58/5.72  % git: non_committed_changes: false
% 30.58/5.72  
% 30.58/5.72  % ------ Parsing...% successful
% 30.58/5.72  
% 30.58/5.72  
% 30.58/5.72  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 30.58/5.72  
% 30.58/5.72  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 18 0s  sf_e  sup_sim: 0  sf_s  rm: 4 0s  sf_e % 
% 30.58/5.72  
% 30.58/5.72  % ------ Preprocessing...% 
% 30.58/5.72  
% 30.58/5.72  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 30.58/5.72  % ------ Proving...
% 30.58/5.72  % ------ Problem Properties 
% 30.58/5.72  
% 30.58/5.72  % 
% 30.58/5.72  % clauses                               2242
% 30.58/5.72  % conjectures                           90
% 30.58/5.72  % EPR                                   663
% 30.58/5.72  % Horn                                  2045
% 30.58/5.72  % unary                                 688
% 30.58/5.72  % binary                                1115
% 30.58/5.72  % lits                                  4458
% 30.58/5.72  % lits eq                               1205
% 30.58/5.72  % fd_pure                               0
% 30.58/5.72  % fd_pseudo                             0
% 30.58/5.72  % fd_cond                               99
% 30.58/5.72  % fd_pseudo_cond                        89
% 30.58/5.72  % AC symbols                            0
% 30.58/5.72  
% 30.58/5.72  % ------ Input Options Time Limit: Unbounded
% 30.58/5.72  
% 30.58/5.72  
% 30.58/5.72  % ------ 
% 30.58/5.72  % Current options:
% 30.58/5.72  % ------ 
% 30.58/5.72  
% 30.58/5.72  
% 30.58/5.72  % 
% 30.58/5.72  
% 30.58/5.72  % ------ Proving...
% 30.58/5.72  % 
% 30.58/5.72  
% 30.58/5.72  % SZS status Unsatisfiable for theBenchmark.p
% 30.58/5.72  
% 30.58/5.72  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 30.58/5.72  
% 30.58/5.72  
%------------------------------------------------------------------------------