↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET025-9 : TPTP v9.3.1. Released v1.0.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 02:46:09 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [X0,X1] : little_set(non_ordered_pair(X0,X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair4) ).

fof(f9,axiom,
    ! [X0] : singleton_set(X0) = non_ordered_pair(X0,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',singleton_set) ).

fof(f10,axiom,
    ! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(singleton_set(X0),non_ordered_pair(X0,X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair) ).

fof(f13,axiom,
    ! [X0] :
      ( X0 = ordered_pair(f2(X0),f3(X0))
      | ~ ordered_pair_predicate(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate3) ).

fof(f14,plain,
    ! [X0] :
      ( ordered_pair(f2(X0),f3(X0)) = X0
      | ~ ordered_pair_predicate(X0) ),
    inference(reorient_equations,[],[f13]) ).

fof(f162,axiom,
    ordered_pair_predicate(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_ordered_pair_predicate) ).

fof(f163,negated_conjecture,
    ~ little_set(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_predicate_is_small) ).

fof(f165,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)),
    inference(definition_unfolding,[],[f10,f9]) ).

fof(f167,plain,
    ! [X0] :
      ( non_ordered_pair(non_ordered_pair(f2(X0),f2(X0)),non_ordered_pair(f2(X0),f3(X0))) = X0
      | ~ ordered_pair_predicate(X0) ),
    inference(definition_unfolding,[],[f14,f165]) ).

tcf(c_199,plain,
    ! [X0: $i,X1: $i] : little_set(non_ordered_pair(X0,X1)),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_202,plain,
    ! [X0: $i] :
      ( ( non_ordered_pair(non_ordered_pair(f2(X0),f2(X0)),non_ordered_pair(f2(X0),f3(X0))) = X0 )
      | ~ ordered_pair_predicate(X0) ),
    inference(cnf_transformation,[],[f167]) ).

tcf(c_327,plain,
    ordered_pair_predicate(a),
    inference(cnf_transformation,[],[f162]) ).

tcf(c_328,negated_conjecture,
    ~ little_set(a),
    inference(cnf_transformation,[],[f163]) ).

tcf(c_9587,negated_conjecture,
    ~ little_set(a),
    inference(demodulation,[status(thm)],[c_328]) ).

tcf(c_11064,plain,
    non_ordered_pair(non_ordered_pair(f2(a),f2(a)),non_ordered_pair(f2(a),f3(a))) = a,
    inference(superposition,[status(thm)],[c_327,c_202]) ).

tcf(c_11124,plain,
    little_set(a),
    inference(superposition,[status(thm)],[c_11064,c_199]) ).

tcf(c_11125,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_11124,c_9587]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET025-9 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35  % Computer : n008.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Thu Sep 24 09:17:09 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/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.13/0.41  
% 0.13/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41  
% 0.13/0.41  % Detected problem language: tptp
% 0.13/0.42  % Proving...
% 4.11/1.29  % SZS status Started for theBenchmark.p
% 4.11/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 4.11/1.29  
% 4.11/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.11/1.29  
% 4.11/1.29  % ------  iProver source info
% 4.11/1.29  
% 4.11/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 4.11/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.11/1.29  % git: non_committed_changes: false
% 4.11/1.29  
% 4.11/1.29  % ------ Parsing...% successful
% 4.11/1.29  
% 4.11/1.29  
% 4.11/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.11/1.29  
% 4.11/1.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 4.11/1.29  
% 4.11/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.11/1.29  
% 4.11/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.11/1.29  % ------ Proving...
% 4.11/1.29  % ------ Problem Properties 
% 4.11/1.29  
% 4.11/1.29  % 
% 4.11/1.29  % clauses                               131
% 4.11/1.29  % conjectures                           1
% 4.11/1.29  % EPR                                   22
% 4.11/1.29  % Horn                                  112
% 4.11/1.29  % unary                                 7
% 4.11/1.29  % binary                                89
% 4.11/1.29  % lits                                  321
% 4.11/1.29  % lits eq                               26
% 4.11/1.29  % fd_pure                               0
% 4.11/1.29  % fd_pseudo                             0
% 4.11/1.29  % fd_cond                               4
% 4.11/1.29  % fd_pseudo_cond                        6
% 4.11/1.29  % AC symbols                            0
% 4.11/1.29  
% 4.11/1.29  % ------ Schedule dynamic 5 is on 
% 4.11/1.29  
% 4.11/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.11/1.29  
% 4.11/1.29  
% 4.11/1.29  % ------ 
% 4.11/1.29  % Current options:
% 4.11/1.29  % ------ 
% 4.11/1.29  
% 4.11/1.29  
% 4.11/1.29  % 
% 4.11/1.29  
% 4.11/1.29  % ------ Proving...
% 4.11/1.29  % 
% 4.11/1.29  
% 4.11/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 4.11/1.29  
% 4.11/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.11/1.29  
% 4.11/1.29  
%------------------------------------------------------------------------------