↑ Up

iProver---3.9.4.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f3181,axiom,
    ! [X0,X1] : c_union(X0,X0,X1) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__absorb_0) ).

fof(f3189,axiom,
    ! [X0,X1] : c_union(X0,c_emptyset,X1) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__empty__right_0) ).

fof(f3431,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(f3433,negated_conjecture,
    c_Message_Oanalz(c_Message_Osynth(v_H)) != c_union(c_Message_Oanalz(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

tcf(c_4915,plain,
    ! [X0: $i,X1: $i] : c_union(X0,X0,X1) = X0,
    inference(cnf_transformation,[],[f3181]) ).

tcf(c_4920,plain,
    ! [X0: $i,X1: $i] : c_union(X0,c_emptyset,X1) = X0,
    inference(cnf_transformation,[],[f3189]) ).

tcf(c_5104,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,[],[f3431]) ).

tcf(c_5106,negated_conjecture,
    c_union(c_Message_Oanalz(v_H),c_Message_Osynth(v_H),tc_Message_Omsg) != c_Message_Oanalz(c_Message_Osynth(v_H)),
    inference(cnf_transformation,[],[f3433]) ).

tcf(c_5680,plain,
    ! [X0: $i] : c_Message_Oanalz(c_union(c_Message_Osynth(X0),X0,tc_Message_Omsg)) = c_union(c_Message_Oanalz(X0),c_Message_Osynth(X0),tc_Message_Omsg),
    inference(superposition,[status(thm)],[c_4915,c_5104]) ).

tcf(c_5682,plain,
    ! [X0: $i] : c_union(c_Message_Oanalz(X0),c_Message_Osynth(X0),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(X0),c_emptyset,tc_Message_Omsg)),
    inference(superposition,[status(thm)],[c_4920,c_5104]) ).

tcf(c_5697,plain,
    c_Message_Oanalz(c_union(c_Message_Osynth(v_H),v_H,tc_Message_Omsg)) != c_Message_Oanalz(c_Message_Osynth(v_H)),
    inference(demodulation,[status(thm)],[c_5106,c_5680]) ).

tcf(c_8245,plain,
    ! [X0: $i] : c_union(c_Message_Oanalz(X0),c_Message_Osynth(X0),tc_Message_Omsg) = c_Message_Oanalz(c_Message_Osynth(X0)),
    inference(demodulation,[status(thm)],[c_5682,c_4920]) ).

tcf(c_8413,plain,
    ! [X0: $i] : c_Message_Oanalz(c_union(c_Message_Osynth(X0),X0,tc_Message_Omsg)) = c_Message_Oanalz(c_Message_Osynth(X0)),
    inference(demodulation,[status(thm)],[c_5680,c_8245]) ).

tcf(c_8447,plain,
    $false,
    inference(superposition,[status(thm)],[c_8413,c_5697]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV243-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38  % Computer : n004.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Thu Sep 24 18:50:37 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  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.44  
% 0.11/0.44  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44  
% 0.11/0.44  % Detected problem language: tptp
% 0.11/0.46  % Proving...
% 11.00/2.34  % SZS status Started for theBenchmark.p
% 11.00/2.34  % SZS status Unsatisfiable for theBenchmark.p
% 11.00/2.34  
% 11.00/2.34  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 11.00/2.34  
% 11.00/2.34  % ------  iProver source info
% 11.00/2.34  
% 11.00/2.34  % git: date: 2026-07-19 20:42:38 +0200
% 11.00/2.34  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 11.00/2.34  % git: non_committed_changes: false
% 11.00/2.34  
% 11.00/2.34  % ------ Parsing...% successful
% 11.00/2.34  
% 11.00/2.34  
% 11.00/2.34  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 11.00/2.34  % ------ Proving...
% 11.00/2.34  % ------ Problem Properties 
% 11.00/2.34  
% 11.00/2.34  % 
% 11.00/2.34  % clauses                               2232
% 11.00/2.34  % conjectures                           1
% 11.00/2.34  % EPR                                   668
% 11.00/2.34  % Horn                                  2036
% 11.00/2.34  % unary                                 664
% 11.00/2.34  % binary                                1115
% 11.00/2.34  % lits                                  4481
% 11.00/2.34  % lits eq                               1236
% 11.00/2.34  % fd_pure                               0
% 11.00/2.34  % fd_pseudo                             0
% 11.00/2.34  % fd_cond                               118
% 11.00/2.34  % fd_pseudo_cond                        77
% 11.00/2.34  % AC symbols                            0
% 11.00/2.34  
% 11.00/2.34  % ------ Input Options Time Limit: Unbounded
% 11.00/2.34  
% 11.00/2.34  
% 11.00/2.34  % ------ 
% 11.00/2.34  % Current options:
% 11.00/2.34  % ------ 
% 11.00/2.34  
% 11.00/2.34  
% 11.00/2.34  % 
% 11.00/2.34  
% 11.00/2.34  % ------ Proving...
% 11.00/2.34  % 
% 11.00/2.34  
% 11.00/2.34  % SZS status Unsatisfiable for theBenchmark.p
% 11.00/2.34  
% 11.00/2.34  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.00/2.34  
% 11.00/2.34  
%------------------------------------------------------------------------------