↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET138-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n001.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:43 PM UTC 2026

% Result   : Unsatisfiable 5.42s 1.95s
% Output   : CNFRefutation 5.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   23 (  14 unt;   0 def)
%            Number of atoms       :   34 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  16   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :   11 (   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    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  25   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f9,axiom,
    ! [X0,X1] :
      ( member(X0,unordered_pair(X0,X1))
      | ~ member(X0,universal_class) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).

fof(f12,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).

fof(f21,axiom,
    ! [X2,X0,X1] :
      ( member(X0,X1)
      | ~ member(X0,intersection(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).

fof(f24,axiom,
    ! [X0,X1] :
      ( ~ member(X0,X1)
      | ~ member(X0,complement(X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).

fof(f25,axiom,
    ! [X0,X1] :
      ( member(X0,X1)
      | member(X0,complement(X1))
      | ~ member(X0,universal_class) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).

fof(f26,axiom,
    ! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).

fof(f101,axiom,
    ! [X0,X1] : union(singleton(X0),X1) = set_builder(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_of_set_builder) ).

fof(f102,negated_conjecture,
    member(u,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_member_of_triple_kludge2_1) ).

fof(f105,negated_conjecture,
    ~ member(u,set_builder(u,set_builder(v,set_builder(w,null_class)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_member_of_triple_kludge2_4) ).

fof(f111,plain,
    ! [X0,X1] : set_builder(X0,X1) = complement(intersection(complement(unordered_pair(X0,X0)),complement(X1))),
    inference(definition_unfolding,[],[f101,f26,f12]) ).

fof(f155,plain,
    ~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))))))),
    inference(definition_unfolding,[],[f105,f111,f111,f111]) ).

tcf(c_153,plain,
    ! [X0: $i,X1: $i] :
      ( member(X0,unordered_pair(X0,X1))
      | ~ member(X0,universal_class) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_163,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(X0,X1)
      | ~ member(X0,intersection(X1,X2)) ),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_166,plain,
    ! [X0: $i,X1: $i] :
      ( ~ member(X0,X1)
      | ~ member(X0,complement(X1)) ),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_167,plain,
    ! [X0: $i,X1: $i] :
      ( member(X0,X1)
      | member(X0,complement(X1))
      | ~ member(X0,universal_class) ),
    inference(cnf_transformation,[],[f25]) ).

tcf(c_220,negated_conjecture,
    member(u,universal_class),
    inference(cnf_transformation,[],[f102]) ).

tcf(c_223,negated_conjecture,
    ~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))))))),
    inference(cnf_transformation,[],[f155]) ).

tcf(c_3459,plain,
    ( member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))))))
    | ~ member(u,universal_class) ),
    inference(superposition,[status(thm)],[c_167,c_223]) ).

tcf(c_3672,plain,
    member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class))))))))),
    inference(global_subsumption_just,[status(thm)],[c_3459,c_220,c_3459]) ).

tcf(c_3676,plain,
    member(u,complement(unordered_pair(u,u))),
    inference(superposition,[status(thm)],[c_3672,c_163]) ).

tcf(c_3719,plain,
    ~ member(u,unordered_pair(u,u)),
    inference(superposition,[status(thm)],[c_3676,c_166]) ).

tcf(c_3783,plain,
    ~ member(u,universal_class),
    inference(superposition,[status(thm)],[c_153,c_3719]) ).

tcf(c_3785,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_3783,c_220]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET138-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.57  % Computer : n001.cluster.edu
% 0.10/0.57  % Model    : x86_64 x86_64
% 0.10/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57  % Memory   : 8046.5625MB
% 0.10/0.57  % OS       : Linux 6.8.0-71-generic
% 0.10/0.57  % CPULimit : 300
% 0.10/0.57  % WCLimit  : 300
% 0.10/0.57  % DateTime : Thu Sep 24 10:05:25 UTC 2026
% 0.10/0.57  % CPUTime  : 
% 0.10/0.57  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.60  Running first-order theorem proving
% 0.14/0.60  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.14/0.61  
% 0.14/0.61  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.61  
% 0.14/0.61  % Detected problem language: tptp
% 0.14/0.63  % Proving...
% 5.42/1.95  % SZS status Started for theBenchmark.p
% 5.42/1.95  % SZS status Unsatisfiable for theBenchmark.p
% 5.42/1.95  
% 5.42/1.95  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.42/1.95  
% 5.42/1.95  % ------  iProver source info
% 5.42/1.95  
% 5.42/1.95  % git: date: 2026-07-19 20:42:38 +0200
% 5.42/1.95  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.42/1.95  % git: non_committed_changes: false
% 5.42/1.95  
% 5.42/1.95  % ------ Parsing...% successful
% 5.42/1.95  
% 5.42/1.95  
% 5.42/1.95  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 5.42/1.95  
% 5.42/1.95  % ------ 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: 2 0s  sf_e  pe_s  pe_e % 
% 5.42/1.95  
% 5.42/1.95  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 5.42/1.95  
% 5.42/1.95  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 5.42/1.95  % ------ Proving...
% 5.42/1.95  % ------ Problem Properties 
% 5.42/1.95  
% 5.42/1.95  % 
% 5.42/1.95  % clauses                               71
% 5.42/1.95  % conjectures                           4
% 5.42/1.95  % EPR                                   15
% 5.42/1.95  % Horn                                  63
% 5.42/1.95  % unary                                 19
% 5.42/1.95  % binary                                32
% 5.42/1.95  % lits                                  149
% 5.42/1.95  % lits eq                               20
% 5.42/1.95  % fd_pure                               0
% 5.42/1.95  % fd_pseudo                             0
% 5.42/1.95  % fd_cond                               3
% 5.42/1.95  % fd_pseudo_cond                        3
% 5.42/1.95  % AC symbols                            0
% 5.42/1.95  
% 5.42/1.95  % ------ Input Options Time Limit: Unbounded
% 5.42/1.95  
% 5.42/1.95  
% 5.42/1.95  % ------ 
% 5.42/1.95  % Current options:
% 5.42/1.95  % ------ 
% 5.42/1.95  
% 5.42/1.95  
% 5.42/1.95  % 
% 5.42/1.95  
% 5.42/1.95  % ------ Proving...
% 5.42/1.95  % 
% 5.42/1.95  
% 5.42/1.95  % SZS status Unsatisfiable for theBenchmark.p
% 5.42/1.95  
% 5.42/1.95  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.42/1.95  
% 5.42/1.95  
%------------------------------------------------------------------------------