↑ Up

iProver---3.9.4.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0,X1] : union(unordered_pair(X0,X1)) = set_union2(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l52_zfmisc_1) ).

fof(f9,conjecture,
    ! [X0,X1] : union(unordered_pair(singleton(X0),singleton(X1))) = unordered_pair(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_zfmisc_1) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1] : union(unordered_pair(singleton(X0),singleton(X1))) = unordered_pair(X0,X1),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f11,axiom,
    ! [X0,X1] : unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t41_enumset1) ).

fof(f15,plain,
    ? [X0,X1] : unordered_pair(X0,X1) != union(unordered_pair(singleton(X0),singleton(X1))),
    inference(ennf_transformation,[],[f10]) ).

fof(f18,plain,
    unordered_pair(sK2,sK3) != union(unordered_pair(singleton(sK2),singleton(sK3))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f15]) ).

fof(f24,plain,
    ! [X0,X1] : set_union2(X0,X1) = union(unordered_pair(X0,X1)),
    inference(cnf_transformation,[],[f6]) ).

fof(f27,plain,
    unordered_pair(sK2,sK3) != union(unordered_pair(singleton(sK2),singleton(sK3))),
    inference(cnf_transformation,[],[f18]) ).

fof(f28,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)),
    inference(cnf_transformation,[],[f11]) ).

fof(f29,plain,
    ! [X0,X1] : set_union2(X0,X1) = union(set_union2(singleton(X0),singleton(X1))),
    inference(definition_unfolding,[],[f24,f28]) ).

fof(f31,plain,
    set_union2(singleton(sK2),singleton(sK3)) != union(set_union2(singleton(singleton(sK2)),singleton(singleton(sK3)))),
    inference(definition_unfolding,[],[f27,f28,f28]) ).

tcf(c_49,plain,
    ! [X0: $i,X1: $i] : union(set_union2(singleton(X0),singleton(X1))) = set_union2(X0,X1),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_57,negated_conjecture,
    union(set_union2(singleton(singleton(sK2)),singleton(singleton(sK3)))) != set_union2(singleton(sK2),singleton(sK3)),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_73,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_57,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET891+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/5.44  % Computer : n005.cluster.edu
% 0.17/5.44  % Model    : x86_64 x86_64
% 0.17/5.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.44  % Memory   : 8046.5625MB
% 0.17/5.44  % OS       : Linux 6.8.0-71-generic
% 0.17/5.44  % CPULimit : 300
% 0.17/5.44  % WCLimit  : 300
% 0.17/5.44  % DateTime : Thu Sep 24 12:20:23 UTC 2026
% 0.17/5.44  % CPUTime  : 
% 0.17/5.44  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/5.49  Running first-order theorem proving
% 0.17/5.49  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/5.51  
% 0.22/5.51  % ======== iProver multi-core TPTP/SMT =========
% 0.22/5.51  
% 0.22/5.51  % Detected problem language: tptp
% 0.22/5.53  % Proving...
% 1.75/6.50  % SZS status Started for theBenchmark.p
% 1.75/6.50  % SZS status Theorem for theBenchmark.p
% 1.75/6.50  
% 1.75/6.50  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.75/6.50  
% 1.75/6.50  % ------  iProver source info
% 1.75/6.50  
% 1.75/6.50  % git: date: 2026-07-19 20:42:38 +0200
% 1.75/6.50  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.75/6.50  % git: non_committed_changes: false
% 1.75/6.50  
% 1.75/6.50  % ------ Parsing...
% 1.75/6.50  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.75/6.50  
% 1.75/6.50  % ------ Preprocessing...% 
% 1.75/6.50  
% 1.75/6.50  % SZS status Theorem for theBenchmark.p
% 1.75/6.50  
% 1.75/6.50  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.75/6.50  
% 1.75/6.50  
%------------------------------------------------------------------------------