↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET027-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n006.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:10 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f79,axiom,
    ! [X2,X0,X1] :
      ( member(X2,X1)
      | ~ member(X2,X0)
      | ~ subset(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',subset1) ).

fof(f80,axiom,
    ! [X0,X1] :
      ( member(f17(X0,X1),X0)
      | subset(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',subset2) ).

fof(f81,axiom,
    ! [X0,X1] :
      ( ~ member(f17(X0,X1),X1)
      | subset(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',subset3) ).

fof(f162,axiom,
    subset(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_subset_b) ).

fof(f163,axiom,
    subset(b,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_subset_c) ).

fof(f164,negated_conjecture,
    ~ subset(a,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_subset_c) ).

tcf(c_255,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(X2,X1)
      | ~ member(X2,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f79]) ).

tcf(c_256,plain,
    ! [X0: $i,X1: $i] :
      ( subset(X0,X1)
      | member(f17(X0,X1),X0) ),
    inference(cnf_transformation,[],[f80]) ).

tcf(c_257,plain,
    ! [X0: $i,X1: $i] :
      ( subset(X0,X1)
      | ~ member(f17(X0,X1),X1) ),
    inference(cnf_transformation,[],[f81]) ).

tcf(c_328,plain,
    subset(a,b),
    inference(cnf_transformation,[],[f162]) ).

tcf(c_329,plain,
    subset(b,c),
    inference(cnf_transformation,[],[f163]) ).

tcf(c_330,negated_conjecture,
    ~ subset(a,c),
    inference(cnf_transformation,[],[f164]) ).

tcf(c_3514,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( subset(X0,X2)
      | member(f17(X0,X2),X1)
      | ~ subset(X0,X1) ),
    inference(superposition,[status(thm)],[c_256,c_255]) ).

tcf(c_3600,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( subset(X0,X3)
      | member(f17(X0,X3),X2)
      | ~ subset(X1,X2)
      | ~ subset(X0,X1) ),
    inference(superposition,[status(thm)],[c_3514,c_255]) ).

tcf(c_3726,plain,
    ! [X0: $i,X1: $i] :
      ( subset(a,X1)
      | member(f17(a,X1),X0)
      | ~ subset(b,X0) ),
    inference(superposition,[status(thm)],[c_328,c_3600]) ).

tcf(c_3975,plain,
    ! [X0: $i] :
      ( subset(a,X0)
      | ~ subset(b,X0) ),
    inference(superposition,[status(thm)],[c_3726,c_257]) ).

tcf(c_4444,plain,
    subset(a,c),
    inference(superposition,[status(thm)],[c_329,c_3975]) ).

tcf(c_4450,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_330,c_4444]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET027-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.59  % Computer : n006.cluster.edu
% 0.11/5.59  % Model    : x86_64 x86_64
% 0.11/5.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.59  % Memory   : 8046.5625MB
% 0.11/5.59  % OS       : Linux 6.8.0-71-generic
% 0.11/5.59  % CPULimit : 300
% 0.11/5.59  % WCLimit  : 300
% 0.11/5.59  % DateTime : Thu Sep 24 09:17:17 UTC 2026
% 0.11/5.59  % CPUTime  : 
% 0.11/5.59  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.63  Running first-order theorem proving
% 0.15/5.63  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/5.65  
% 0.15/5.65  % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.65  
% 0.15/5.65  % Detected problem language: tptp
% 0.15/5.66  % Proving...
% 3.93/6.51  % SZS status Started for theBenchmark.p
% 3.93/6.51  % SZS status Unsatisfiable for theBenchmark.p
% 3.93/6.51  
% 3.93/6.51  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.93/6.51  
% 3.93/6.51  % ------  iProver source info
% 3.93/6.51  
% 3.93/6.51  % git: date: 2026-07-19 20:42:38 +0200
% 3.93/6.51  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.93/6.51  % git: non_committed_changes: false
% 3.93/6.51  
% 3.93/6.51  % ------ Parsing...% successful
% 3.93/6.51  
% 3.93/6.51  
% 3.93/6.51  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % ------ Problem Properties 
% 3.93/6.51  
% 3.93/6.51  % 
% 3.93/6.51  % clauses                               138
% 3.93/6.51  % conjectures                           1
% 3.93/6.51  % EPR                                   27
% 3.93/6.51  % Horn                                  118
% 3.93/6.51  % unary                                 9
% 3.93/6.51  % binary                                92
% 3.93/6.51  % lits                                  338
% 3.93/6.51  % lits eq                               27
% 3.93/6.51  % fd_pure                               0
% 3.93/6.51  % fd_pseudo                             0
% 3.93/6.51  % fd_cond                               4
% 3.93/6.51  % fd_pseudo_cond                        7
% 3.93/6.51  % AC symbols                            0
% 3.93/6.51  
% 3.93/6.51  % ------ Input Options Time Limit: Unbounded
% 3.93/6.51  
% 3.93/6.51  
% 3.93/6.51  % ------ 
% 3.93/6.51  % Current options:
% 3.93/6.51  % ------ 
% 3.93/6.51  
% 3.93/6.51  
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % ------ Proving...
% 3.93/6.51  % 
% 3.93/6.51  
% 3.93/6.51  % SZS status Unsatisfiable for theBenchmark.p
% 3.93/6.51  
% 3.93/6.51  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.93/6.51  
% 3.93/6.51  
%------------------------------------------------------------------------------