↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV259-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 : n008.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:50 PM UTC 2026

% Result   : Unsatisfiable 1.34s 1.09s
% Output   : CNFRefutation 1.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   8 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   15 (   9   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   23 (   0 sgn  23   !;   0   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f131,axiom,
    ! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).

fof(f3258,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(X1,X3,tc_set(X2))
      | ~ c_lessequals(c_insert(X0,X1,X2),X3,tc_set(X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_Oinsert__subset_1) ).

fof(f3378,axiom,
    ! [X0,X1] :
      ( c_lessequals(X0,c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_0) ).

fof(f3379,axiom,
    ! [X0,X1] :
      ( c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(X0,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_1) ).

fof(f3381,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

tcf(c_2938,plain,
    ! [X0: $i,X1: $i] : c_lessequals(X0,X0,tc_set(X1)),
    inference(cnf_transformation,[],[f131]) ).

tcf(c_4923,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_lessequals(X1,X3,tc_set(X2))
      | ~ c_lessequals(c_insert(X0,X1,X2),X3,tc_set(X2)) ),
    inference(cnf_transformation,[],[f3258]) ).

tcf(c_5009,plain,
    ! [X0: $i,X1: $i] :
      ( c_lessequals(X0,c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)) ),
    inference(cnf_transformation,[],[f3378]) ).

tcf(c_5010,plain,
    ! [X0: $i,X1: $i] :
      ( c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(X0,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)) ),
    inference(cnf_transformation,[],[f3379]) ).

tcf(c_5012,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(cnf_transformation,[],[f3381]) ).

tcf(c_5312,plain,
    ~ c_lessequals(v_H,c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(superposition,[status(thm)],[c_5010,c_5012]) ).

tcf(c_5322,plain,
    ! [X0: $i] : c_lessequals(X0,c_Message_Oparts(X0),tc_set(tc_Message_Omsg)),
    inference(superposition,[status(thm)],[c_2938,c_5009]) ).

tcf(c_5841,plain,
    ! [X0: $i,X1: $i] : c_lessequals(X0,c_Message_Oparts(c_insert(X1,X0,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(superposition,[status(thm)],[c_5322,c_4923]) ).

tcf(c_5843,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_5312,c_5841]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV259-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.09/0.36  % Computer : n008.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 18:56:09 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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.14/0.41  
% 0.14/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41  
% 0.14/0.41  % Detected problem language: tptp
% 0.14/0.42  % Proving...
% 1.34/1.09  % SZS status Started for theBenchmark.p
% 1.34/1.09  % SZS status Unsatisfiable for theBenchmark.p
% 1.34/1.09  
% 1.34/1.09  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.34/1.09  
% 1.34/1.09  % ------  iProver source info
% 1.34/1.09  
% 1.34/1.09  % git: date: 2026-07-19 20:42:38 +0200
% 1.34/1.09  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.34/1.09  % git: non_committed_changes: false
% 1.34/1.09  
% 1.34/1.09  % ------ Parsing...% successful
% 1.34/1.09  
% 1.34/1.09  
% 1.34/1.09  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.34/1.09  % ------ Proving...
% 1.34/1.09  % ------ Problem Properties 
% 1.34/1.09  
% 1.34/1.09  % 
% 1.34/1.09  % clauses                               2185
% 1.34/1.09  % conjectures                           2
% 1.34/1.09  % EPR                                   668
% 1.34/1.09  % Horn                                  1997
% 1.34/1.09  % unary                                 644
% 1.34/1.09  % binary                                1097
% 1.34/1.09  % lits                                  4398
% 1.34/1.09  % lits eq                               1212
% 1.34/1.09  % fd_pure                               0
% 1.34/1.09  % fd_pseudo                             0
% 1.34/1.09  % fd_cond                               118
% 1.34/1.09  % fd_pseudo_cond                        77
% 1.34/1.09  % AC symbols                            0
% 1.34/1.09  
% 1.34/1.09  % ------ Input Options Time Limit: Unbounded
% 1.34/1.09  
% 1.34/1.09  
% 1.34/1.09  % ------ 
% 1.34/1.09  % Current options:
% 1.34/1.09  % ------ 
% 1.34/1.09  
% 1.34/1.09  
% 1.34/1.09  % 
% 1.34/1.09  
% 1.34/1.09  % ------ Proving...
% 1.34/1.09  % 
% 1.34/1.09  
% 1.34/1.09  % SZS status Unsatisfiable for theBenchmark.p
% 1.34/1.09  
% 1.34/1.09  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.34/1.09  
% 1.34/1.09  
%------------------------------------------------------------------------------