↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET025+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n010.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:46:08 PM UTC 2026

% Result   : Theorem 1.39s 1.29s
% Output   : CNFRefutation 1.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (  16 unt;   0 def)
%            Number of atoms       :   16 (   5 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    :    4 (   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-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn  18   !;   2   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair) ).

fof(f6,axiom,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).

fof(f7,axiom,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).

fof(f44,conjecture,
    ! [X0,X1] : member(ordered_pair(X0,X1),universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_is_set) ).

fof(f45,negated_conjecture,
    ~ ! [X0,X1] : member(ordered_pair(X0,X1),universal_class),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f60,plain,
    ? [X0,X1] : ~ member(ordered_pair(X0,X1),universal_class),
    inference(ennf_transformation,[],[f45]) ).

fof(f103,plain,
    ~ member(ordered_pair(sK6,sK7),universal_class),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f60]) ).

fof(f115,plain,
    ! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
    inference(cnf_transformation,[],[f5]) ).

fof(f116,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f6]) ).

fof(f117,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
    inference(cnf_transformation,[],[f7]) ).

fof(f191,plain,
    ~ member(ordered_pair(sK6,sK7),universal_class),
    inference(cnf_transformation,[],[f103]) ).

fof(f192,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
    inference(definition_unfolding,[],[f117,f116,f116]) ).

fof(f229,plain,
    ~ member(unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7))),universal_class),
    inference(definition_unfolding,[],[f191,f192]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] : member(unordered_pair(X0,X1),universal_class),
    inference(cnf_transformation,[],[f115]) ).

tcf(c_128,negated_conjecture,
    ~ member(unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7))),universal_class),
    inference(cnf_transformation,[],[f229]) ).

tcf(c_203,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_128,c_60]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET025+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37  % Computer : n010.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Thu Sep 24 09:15:44 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.15/0.42  
% 0.15/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42  
% 0.15/0.42  % Detected problem language: tptp
% 0.15/0.44  % Proving...
% 1.39/1.29  % SZS status Started for theBenchmark.p
% 1.39/1.29  % SZS status Theorem for theBenchmark.p
% 1.39/1.29  
% 1.39/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.39/1.29  
% 1.39/1.29  % ------  iProver source info
% 1.39/1.29  
% 1.39/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 1.39/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.39/1.29  % git: non_committed_changes: false
% 1.39/1.29  
% 1.39/1.29  % ------ Parsing...
% 1.39/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.39/1.29  
% 1.39/1.29  % ------ Preprocessing...% 
% 1.39/1.29  
% 1.39/1.29  % SZS status Theorem for theBenchmark.p
% 1.39/1.29  
% 1.39/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.39/1.29  
% 1.39/1.29  
%------------------------------------------------------------------------------