↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 141.54s 30.00s
% Output   : CNFRefutation 141.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   21 (  13 unt;   0 def)
%            Number of atoms       :   32 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  11   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :   35 (   0 sgn  35   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f3190,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,X1,X3)
      | c_in(X0,X2,X3)
      | ~ c_in(X0,c_union(X1,X2,X3),X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__iff_0) ).

fof(f3191,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,c_union(X1,X3,X2),X2)
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__iff_1) ).

fof(f3192,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,c_union(X3,X1,X2),X2)
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__iff_2) ).

fof(f3430,axiom,
    ! [X0,X1] : c_Message_Oanalz(c_union(c_Message_Oanalz(X0),X1,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__analz__Un_0) ).

fof(f3433,axiom,
    ! [X0,X1] : c_Message_Oanalz(c_union(c_Message_Osynth(X0),X1,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)),c_Message_Osynth(X0),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__synth__Un_0) ).

fof(f3438,negated_conjecture,
    c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f3439,negated_conjecture,
    ~ c_in(v_x,c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

tcf(c_2883,negated_conjecture,
    c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
    inference(cnf_transformation,[],[f3438]) ).

tcf(c_2884,negated_conjecture,
    ~ c_in(v_x,c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_Message_Omsg),
    inference(cnf_transformation,[],[f3439]) ).

tcf(c_2887,plain,
    ! [X0: $i,X1: $i] : c_union(c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)),c_Message_Osynth(X0),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(X0),X1,tc_Message_Omsg)),
    inference(cnf_transformation,[],[f3433]) ).

tcf(c_2894,plain,
    ! [X0: $i,X1: $i] : c_Message_Oanalz(c_union(c_Message_Oanalz(X0),X1,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)),
    inference(cnf_transformation,[],[f3430]) ).

tcf(c_2930,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X0,c_union(X3,X1,X2),X2)
      | ~ c_in(X0,X1,X2) ),
    inference(cnf_transformation,[],[f3192]) ).

tcf(c_2931,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X0,c_union(X1,X3,X2),X2)
      | ~ c_in(X0,X1,X2) ),
    inference(cnf_transformation,[],[f3191]) ).

tcf(c_2932,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X0,X2,X3)
      | c_in(X0,X1,X3)
      | ~ c_in(X0,c_union(X1,X2,X3),X3) ),
    inference(cnf_transformation,[],[f3190]) ).

tcf(c_377257,plain,
    ~ c_in(v_x,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
    inference(superposition,[status(thm)],[c_2930,c_2884]) ).

tcf(c_377281,plain,
    ~ c_in(v_x,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
    inference(superposition,[status(thm)],[c_2931,c_2884]) ).

tcf(c_377305,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( c_in(X0,c_Message_Osynth(X1),tc_Message_Omsg)
      | c_in(X0,c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),tc_Message_Omsg)
      | ~ c_in(X0,c_Message_Oanalz(c_union(c_Message_Osynth(X1),X2,tc_Message_Omsg)),tc_Message_Omsg) ),
    inference(superposition,[status(thm)],[c_2887,c_2932]) ).

tcf(c_401724,plain,
    ( c_in(v_x,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)
    | c_in(v_x,c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
    inference(superposition,[status(thm)],[c_2883,c_377305]) ).

tcf(c_401745,plain,
    c_in(v_x,c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),tc_Message_Omsg),
    inference(forward_subsumption_resolution,[status(thm)],[c_401724,c_377281]) ).

tcf(c_402435,plain,
    c_in(v_x,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
    inference(demodulation,[status(thm)],[c_401745,c_2894]) ).

tcf(c_402436,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_402435,c_377257]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV250-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.37  % Computer : n026.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Thu Sep 24 18:55:26 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/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.09/0.42  
% 0.09/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42  
% 0.09/0.42  % Detected problem language: tptp
% 0.09/0.44  % Proving...
% 141.54/30.00  % SZS status Started for theBenchmark.p
% 141.54/30.00  % SZS status Unsatisfiable for theBenchmark.p
% 141.54/30.00  
% 141.54/30.00  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 141.54/30.00  
% 141.54/30.00  % ------  iProver source info
% 141.54/30.00  
% 141.54/30.00  % git: date: 2026-07-19 20:42:38 +0200
% 141.54/30.00  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 141.54/30.00  % git: non_committed_changes: false
% 141.54/30.00  
% 141.54/30.00  % ------ Parsing...% successful
% 141.54/30.00  
% 141.54/30.00  
% 141.54/30.00  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 141.54/30.00  
% 141.54/30.00  % ------ Preprocessing... sup_sim: 34  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sup_sim: 12  sf_s  rm: 7 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 7 0s  sf_e  pe_s  pe_e % 
% 141.54/30.00  
% 141.54/30.00  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 141.54/30.00  
% 141.54/30.00  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 141.54/30.00  % ------ Proving...
% 141.54/30.00  % ------ Problem Properties 
% 141.54/30.00  
% 141.54/30.00  % 
% 141.54/30.00  % clauses                               458
% 141.54/30.00  % conjectures                           4
% 141.54/30.00  % EPR                                   22
% 141.54/30.00  % Horn                                  406
% 141.54/30.00  % unary                                 177
% 141.54/30.00  % binary                                202
% 141.54/30.00  % lits                                  820
% 141.54/30.00  % lits eq                               316
% 141.54/30.00  % fd_pure                               0
% 141.54/30.00  % fd_pseudo                             0
% 141.54/30.00  % fd_cond                               28
% 141.54/30.00  % fd_pseudo_cond                        25
% 141.54/30.00  % AC symbols                            0
% 141.54/30.00  
% 141.54/30.00  % ------ Schedule dynamic 5 is on 
% 141.54/30.00  
% 141.54/30.00  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 141.54/30.00  
% 141.54/30.00  
% 141.54/30.00  % ------ 
% 141.54/30.00  % Current options:
% 141.54/30.00  % ------ 
% 141.54/30.00  
% 141.54/30.00  
% 141.54/30.00  % 
% 141.54/30.00  
% 141.54/30.00  % ------ Proving...
% 141.54/30.00  % Proof_search_loop: time out after: 4970 full_loop iterations
% 141.54/30.00  
% 141.54/30.00  % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 141.54/30.00  
% 141.54/30.00  
% 141.54/30.00  % ------ 
% 141.54/30.00  % Current options:
% 141.54/30.00  % ------ 
% 141.54/30.00  
% 141.54/30.00  
% 141.54/30.00  % 
% 141.54/30.00  
% 141.54/30.00  % ------ Proving...
% 141.54/30.00  % Proof_search_loop: time out after: 8909 full_loop iterations
% 141.54/30.00  
% 141.54/30.00  % ------ Option_1: Negative Selections Time Limit: 35.
% 141.54/30.00  
% 141.54/30.00  
% 141.54/30.00  % ------ 
% 141.54/30.00  % Current options:
% 141.54/30.00  % ------ 
% 141.54/30.00  
% 141.54/30.00  
% 141.54/30.00  % 
% 141.54/30.00  
% 141.54/30.00  % ------ Proving...
% 141.54/30.00  % 
% 141.54/30.00  
% 141.54/30.00  % SZS status Unsatisfiable for theBenchmark.p
% 141.54/30.00  
% 141.54/30.00  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 141.54/30.00  
% 141.54/30.00  
%------------------------------------------------------------------------------