↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET137-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/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 7.34s 2.01s
% Output   : CNFRefutation 7.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   44 (  17 unt;   0 def)
%            Number of atoms       :   78 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   65 (  31   ~;  34   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :   12 (   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    :   13 (  13 usr;   6 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn  56   !;   0   ?;  31   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] :
      ( member(X2,X1)
      | ~ member(X2,X0)
      | ~ subclass(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).

fof(f4,axiom,
    ! [X0] : subclass(X0,universal_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

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

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

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

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

fof(f24,axiom,
    ! [X0,X1] :
      ( ~ member(X0,X1)
      | ~ member(X0,complement(X1)) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).

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

fof(f67,axiom,
    ! [X0] :
      ( member(regular(X0),X0)
      | X0 = null_class ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).

fof(f68,plain,
    ! [X0] :
      ( member(regular(X0),X0)
      | null_class = X0 ),
    inference(reorient_equations,[],[f67]) ).

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

fof(f102,negated_conjecture,
    member(u,x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple_kludge1_1) ).

fof(f105,negated_conjecture,
    set_builder(u,set_builder(v,set_builder(w,null_class))) = null_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple_kludge1_4) ).

fof(f106,plain,
    null_class = set_builder(u,set_builder(v,set_builder(w,null_class))),
    inference(reorient_equations,[],[f105]) ).

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

fof(f156,plain,
    null_class = 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,[],[f106,f112,f112,f112]) ).

tcf(c_145,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(X0,X2)
      | ~ subclass(X1,X2)
      | ~ member(X0,X1) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_148,plain,
    ! [X0: $i] : subclass(X0,universal_class),
    inference(cnf_transformation,[],[f4]) ).

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_164,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(X0,X2)
      | ~ member(X0,intersection(X1,X2)) ),
    inference(cnf_transformation,[],[f22]) ).

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_197,plain,
    ! [X0: $i] :
      ( member(regular(X0),X0)
      | ( X0 = null_class ) ),
    inference(cnf_transformation,[],[f68]) ).

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

tcf(c_223,negated_conjecture,
    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))))))))) = null_class,
    inference(cnf_transformation,[],[f156]) ).

tcf(c_3556,plain,
    ! [X0: $i,X1: $i] :
      ( member(regular(intersection(X0,X1)),X0)
      | ( intersection(X0,X1) = null_class ) ),
    inference(superposition,[status(thm)],[c_197,c_163]) ).

tcf(c_3592,plain,
    ! [X0: $i,X1: $i] :
      ( member(regular(intersection(X0,X1)),X1)
      | ( intersection(X0,X1) = null_class ) ),
    inference(superposition,[status(thm)],[c_197,c_164]) ).

tcf(c_3619,plain,
    ! [X0: $i] :
      ( ~ member(X0,null_class)
      | ~ member(X0,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(superposition,[status(thm)],[c_223,c_166]) ).

tcf(c_3717,plain,
    ! [X0: $i] :
      ( member(u,X0)
      | ~ subclass(x,X0) ),
    inference(superposition,[status(thm)],[c_220,c_145]) ).

tcf(c_3876,plain,
    member(u,universal_class),
    inference(superposition,[status(thm)],[c_148,c_3717]) ).

tcf(c_3928,plain,
    ! [X0: $i] :
      ( member(X0,null_class)
      | member(X0,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(X0,universal_class) ),
    inference(superposition,[status(thm)],[c_223,c_167]) ).

tcf(c_4131,plain,
    ! [X0: $i] :
      ( member(X0,null_class)
      | member(X0,complement(unordered_pair(u,u)))
      | ~ member(X0,universal_class) ),
    inference(superposition,[status(thm)],[c_3928,c_163]) ).

tcf(c_4209,plain,
    ! [X0: $i] :
      ( member(X0,null_class)
      | ~ member(X0,universal_class)
      | ~ member(X0,unordered_pair(u,u)) ),
    inference(superposition,[status(thm)],[c_4131,c_166]) ).

tcf(c_4564,plain,
    ( member(u,null_class)
    | ~ member(u,universal_class) ),
    inference(superposition,[status(thm)],[c_153,c_4209]) ).

tcf(c_4851,plain,
    ! [X0: $i] :
      ( ~ member(X0,null_class)
      | ~ member(X0,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(superposition,[status(thm)],[c_223,c_166]) ).

tcf(c_5466,plain,
    ! [X0: $i] :
      ( ( intersection(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)))))))),X0) = null_class )
      | ~ member(regular(intersection(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)))))))),X0)),null_class) ),
    inference(superposition,[status(thm)],[c_3556,c_4851]) ).

tcf(c_5989,plain,
    intersection(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)))))))),null_class) = null_class,
    inference(superposition,[status(thm)],[c_3592,c_5466]) ).

tcf(c_6442,plain,
    member(u,null_class),
    inference(global_subsumption_just,[status(thm)],[c_4564,c_3876,c_4564]) ).

tcf(c_6573,plain,
    ! [X0: $i] :
      ( member(X0,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(X0,null_class) ),
    inference(superposition,[status(thm)],[c_5989,c_163]) ).

tcf(c_6682,plain,
    ! [X0: $i] :
      ( ~ member(X0,null_class)
      | ~ member(X0,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(superposition,[status(thm)],[c_223,c_166]) ).

tcf(c_7041,plain,
    ! [X0: $i] : ~ member(X0,null_class),
    inference(global_subsumption_just,[status(thm)],[c_6682,c_3619,c_6573]) ).

tcf(c_7050,plain,
    $false,
    inference(superposition,[status(thm)],[c_6442,c_7041]) ).


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