TSTP Solution File: SET619+3 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SET619+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 15:08:41 EDT 2023

% Result   : Theorem 3.57s 1.16s
% Output   : CNFRefutation 3.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (  31 unt;   0 def)
%            Number of atoms       :   33 (  32 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   12 (  11   ~;   0   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   52 (   2 sgn;  30   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetric_difference_defn) ).

fof(f2,axiom,
    ! [X0,X1,X2] : union(union(X0,X1),X2) = union(X0,union(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_union) ).

fof(f3,axiom,
    ! [X0,X1] : union(X0,intersection(X0,X1)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_intersection) ).

fof(f4,axiom,
    ! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_intersection_difference) ).

fof(f8,axiom,
    ! [X0,X1] : union(X0,X1) = union(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).

fof(f9,axiom,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).

fof(f14,conjecture,
    ! [X0,X1] : union(X0,X1) = union(symmetric_difference(X0,X1),intersection(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th95) ).

fof(f15,negated_conjecture,
    ~ ! [X0,X1] : union(X0,X1) = union(symmetric_difference(X0,X1),intersection(X0,X1)),
    inference(negated_conjecture,[],[f14]) ).

fof(f17,plain,
    ? [X0,X1] : union(X0,X1) != union(symmetric_difference(X0,X1),intersection(X0,X1)),
    inference(ennf_transformation,[],[f15]) ).

fof(f32,plain,
    ( ? [X0,X1] : union(X0,X1) != union(symmetric_difference(X0,X1),intersection(X0,X1))
   => union(sK2,sK3) != union(symmetric_difference(sK2,sK3),intersection(sK2,sK3)) ),
    introduced(choice_axiom,[]) ).

fof(f33,plain,
    union(sK2,sK3) != union(symmetric_difference(sK2,sK3),intersection(sK2,sK3)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f17,f32]) ).

fof(f34,plain,
    ! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
    inference(cnf_transformation,[],[f1]) ).

fof(f35,plain,
    ! [X2,X0,X1] : union(union(X0,X1),X2) = union(X0,union(X1,X2)),
    inference(cnf_transformation,[],[f2]) ).

fof(f36,plain,
    ! [X0,X1] : union(X0,intersection(X0,X1)) = X0,
    inference(cnf_transformation,[],[f3]) ).

fof(f37,plain,
    ! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
    inference(cnf_transformation,[],[f4]) ).

fof(f47,plain,
    ! [X0,X1] : union(X0,X1) = union(X1,X0),
    inference(cnf_transformation,[],[f8]) ).

fof(f48,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(cnf_transformation,[],[f9]) ).

fof(f58,plain,
    union(sK2,sK3) != union(symmetric_difference(sK2,sK3),intersection(sK2,sK3)),
    inference(cnf_transformation,[],[f33]) ).

fof(f60,plain,
    union(sK2,sK3) != union(union(difference(sK2,sK3),difference(sK3,sK2)),intersection(sK2,sK3)),
    inference(definition_unfolding,[],[f58,f34]) ).

cnf(c_49,plain,
    union(union(X0,X1),X2) = union(X0,union(X1,X2)),
    inference(cnf_transformation,[],[f35]) ).

cnf(c_50,plain,
    union(X0,intersection(X0,X1)) = X0,
    inference(cnf_transformation,[],[f36]) ).

cnf(c_51,plain,
    union(intersection(X0,X1),difference(X0,X1)) = X0,
    inference(cnf_transformation,[],[f37]) ).

cnf(c_61,plain,
    union(X0,X1) = union(X1,X0),
    inference(cnf_transformation,[],[f47]) ).

cnf(c_62,plain,
    intersection(X0,X1) = intersection(X1,X0),
    inference(cnf_transformation,[],[f48]) ).

cnf(c_70,negated_conjecture,
    union(union(difference(sK2,sK3),difference(sK3,sK2)),intersection(sK2,sK3)) != union(sK2,sK3),
    inference(cnf_transformation,[],[f60]) ).

cnf(c_85,negated_conjecture,
    union(intersection(sK2,sK3),union(difference(sK2,sK3),difference(sK3,sK2))) != union(sK2,sK3),
    inference(theory_normalisation,[status(thm)],[c_70,c_49,c_61]) ).

cnf(c_218,plain,
    union(difference(sK3,sK2),sK2) != union(sK2,sK3),
    inference(ac_demodulation,[status(thm)],[c_85,c_51,c_49,c_61]) ).

cnf(c_219,plain,
    union(sK2,difference(sK3,sK2)) != union(sK2,sK3),
    inference(theory_normalisation,[status(thm)],[c_218,c_49,c_61]) ).

cnf(c_650,plain,
    union(intersection(X0,X1),difference(X1,X0)) = X1,
    inference(superposition,[status(thm)],[c_62,c_51]) ).

cnf(c_798,plain,
    union(X0,union(intersection(X0,X1),X2)) = union(X0,X2),
    inference(superposition,[status(thm)],[c_50,c_49]) ).

cnf(c_1467,plain,
    union(X0,difference(X1,X0)) = union(X0,X1),
    inference(superposition,[status(thm)],[c_650,c_798]) ).

cnf(c_1507,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_219,c_1467]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET619+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Sat Aug 26 13:49:22 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.57/1.16  % SZS status Started for theBenchmark.p
% 3.57/1.16  % SZS status Theorem for theBenchmark.p
% 3.57/1.16  
% 3.57/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.57/1.16  
% 3.57/1.16  ------  iProver source info
% 3.57/1.16  
% 3.57/1.16  git: date: 2023-05-31 18:12:56 +0000
% 3.57/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.57/1.16  git: non_committed_changes: false
% 3.57/1.16  git: last_make_outside_of_git: false
% 3.57/1.16  
% 3.57/1.16  ------ Parsing...
% 3.57/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.57/1.16  
% 3.57/1.16  ------ Preprocessing... sup_sim: 1  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 3.57/1.16  
% 3.57/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.57/1.16  
% 3.57/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.57/1.16  ------ Proving...
% 3.57/1.16  ------ Problem Properties 
% 3.57/1.16  
% 3.57/1.16  
% 3.57/1.16  clauses                                 19
% 3.57/1.16  conjectures                             0
% 3.57/1.16  EPR                                     3
% 3.57/1.16  Horn                                    16
% 3.57/1.16  unary                                   7
% 3.57/1.16  binary                                  6
% 3.57/1.16  lits                                    37
% 3.57/1.16  lits eq                                 9
% 3.57/1.16  fd_pure                                 0
% 3.57/1.16  fd_pseudo                               0
% 3.57/1.16  fd_cond                                 0
% 3.57/1.16  fd_pseudo_cond                          3
% 3.57/1.16  AC symbols                              1
% 3.57/1.16  
% 3.57/1.16  ------ Schedule dynamic 5 is on 
% 3.57/1.16  
% 3.57/1.16  ------ no conjectures: strip conj schedule 
% 3.57/1.16  
% 3.57/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.57/1.16  
% 3.57/1.16  
% 3.57/1.16  ------ 
% 3.57/1.16  Current options:
% 3.57/1.16  ------ 
% 3.57/1.16  
% 3.57/1.16  
% 3.57/1.16  
% 3.57/1.16  
% 3.57/1.16  ------ Proving...
% 3.57/1.16  
% 3.57/1.16  
% 3.57/1.16  % SZS status Theorem for theBenchmark.p
% 3.57/1.16  
% 3.57/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.57/1.16  
% 3.57/1.16  
%------------------------------------------------------------------------------