TSTP Solution File: SET968+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET968+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% 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 : Sun May  5 09:09:12 EDT 2024

% Result   : Theorem 0.59s 0.76s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  15 unt;   0 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (  11   ~;   0   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   31 (  23   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f27,plain,
    $false,
    inference(subsumption_resolution,[],[f26,f16]) ).

fof(f16,plain,
    ! [X2,X0,X1] : set_union2(set_union2(X0,X1),X2) = set_union2(X0,set_union2(X1,X2)),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,axiom,
    ! [X0,X1,X2] : set_union2(set_union2(X0,X1),X2) = set_union2(X0,set_union2(X1,X2)),
    file('/export/starexec/sandbox/tmp/tmp.Czn4Fsx466/Vampire---4.8_30577',t4_xboole_1) ).

fof(f26,plain,
    set_union2(set_union2(cartesian_product2(sK0,sK2),cartesian_product2(sK0,sK3)),set_union2(cartesian_product2(sK1,sK2),cartesian_product2(sK1,sK3))) != set_union2(cartesian_product2(sK0,sK2),set_union2(cartesian_product2(sK0,sK3),set_union2(cartesian_product2(sK1,sK2),cartesian_product2(sK1,sK3)))),
    inference(forward_demodulation,[],[f25,f20]) ).

fof(f20,plain,
    ! [X2,X0,X1] : cartesian_product2(X2,set_union2(X0,X1)) = set_union2(cartesian_product2(X2,X0),cartesian_product2(X2,X1)),
    inference(cnf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1,X2] :
      ( cartesian_product2(X2,set_union2(X0,X1)) = set_union2(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
      & cartesian_product2(set_union2(X0,X1),X2) = set_union2(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.Czn4Fsx466/Vampire---4.8_30577',t120_zfmisc_1) ).

fof(f25,plain,
    set_union2(cartesian_product2(sK0,sK2),set_union2(cartesian_product2(sK0,sK3),set_union2(cartesian_product2(sK1,sK2),cartesian_product2(sK1,sK3)))) != set_union2(cartesian_product2(sK0,set_union2(sK2,sK3)),set_union2(cartesian_product2(sK1,sK2),cartesian_product2(sK1,sK3))),
    inference(forward_demodulation,[],[f23,f20]) ).

fof(f23,plain,
    set_union2(cartesian_product2(sK0,sK2),set_union2(cartesian_product2(sK0,sK3),set_union2(cartesian_product2(sK1,sK2),cartesian_product2(sK1,sK3)))) != set_union2(cartesian_product2(sK0,set_union2(sK2,sK3)),cartesian_product2(sK1,set_union2(sK2,sK3))),
    inference(superposition,[],[f22,f19]) ).

fof(f19,plain,
    ! [X2,X0,X1] : cartesian_product2(set_union2(X0,X1),X2) = set_union2(cartesian_product2(X0,X2),cartesian_product2(X1,X2)),
    inference(cnf_transformation,[],[f7]) ).

fof(f22,plain,
    cartesian_product2(set_union2(sK0,sK1),set_union2(sK2,sK3)) != set_union2(cartesian_product2(sK0,sK2),set_union2(cartesian_product2(sK0,sK3),set_union2(cartesian_product2(sK1,sK2),cartesian_product2(sK1,sK3)))),
    inference(forward_demodulation,[],[f21,f16]) ).

fof(f21,plain,
    cartesian_product2(set_union2(sK0,sK1),set_union2(sK2,sK3)) != set_union2(set_union2(cartesian_product2(sK0,sK2),cartesian_product2(sK0,sK3)),set_union2(cartesian_product2(sK1,sK2),cartesian_product2(sK1,sK3))),
    inference(forward_demodulation,[],[f15,f16]) ).

fof(f15,plain,
    cartesian_product2(set_union2(sK0,sK1),set_union2(sK2,sK3)) != set_union2(set_union2(set_union2(cartesian_product2(sK0,sK2),cartesian_product2(sK0,sK3)),cartesian_product2(sK1,sK2)),cartesian_product2(sK1,sK3)),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    cartesian_product2(set_union2(sK0,sK1),set_union2(sK2,sK3)) != set_union2(set_union2(set_union2(cartesian_product2(sK0,sK2),cartesian_product2(sK0,sK3)),cartesian_product2(sK1,sK2)),cartesian_product2(sK1,sK3)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f12,f13]) ).

fof(f13,plain,
    ( ? [X0,X1,X2,X3] : cartesian_product2(set_union2(X0,X1),set_union2(X2,X3)) != set_union2(set_union2(set_union2(cartesian_product2(X0,X2),cartesian_product2(X0,X3)),cartesian_product2(X1,X2)),cartesian_product2(X1,X3))
   => cartesian_product2(set_union2(sK0,sK1),set_union2(sK2,sK3)) != set_union2(set_union2(set_union2(cartesian_product2(sK0,sK2),cartesian_product2(sK0,sK3)),cartesian_product2(sK1,sK2)),cartesian_product2(sK1,sK3)) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ? [X0,X1,X2,X3] : cartesian_product2(set_union2(X0,X1),set_union2(X2,X3)) != set_union2(set_union2(set_union2(cartesian_product2(X0,X2),cartesian_product2(X0,X3)),cartesian_product2(X1,X2)),cartesian_product2(X1,X3)),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,negated_conjecture,
    ~ ! [X0,X1,X2,X3] : cartesian_product2(set_union2(X0,X1),set_union2(X2,X3)) = set_union2(set_union2(set_union2(cartesian_product2(X0,X2),cartesian_product2(X0,X3)),cartesian_product2(X1,X2)),cartesian_product2(X1,X3)),
    inference(negated_conjecture,[],[f8]) ).

fof(f8,conjecture,
    ! [X0,X1,X2,X3] : cartesian_product2(set_union2(X0,X1),set_union2(X2,X3)) = set_union2(set_union2(set_union2(cartesian_product2(X0,X2),cartesian_product2(X0,X3)),cartesian_product2(X1,X2)),cartesian_product2(X1,X3)),
    file('/export/starexec/sandbox/tmp/tmp.Czn4Fsx466/Vampire---4.8_30577',t121_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SET968+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36  % Computer : n006.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 16:57:08 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.Czn4Fsx466/Vampire---4.8_30577
% 0.59/0.75  % (30841)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.59/0.75  % (30834)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.75  % (30835)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.59/0.75  % (30836)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.75  % (30837)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.75  % (30838)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.75  % (30840)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.75  % (30841)Refutation not found, incomplete strategy% (30841)------------------------------
% 0.59/0.75  % (30841)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75  % (30841)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75  
% 0.59/0.75  % (30841)Memory used [KB]: 956
% 0.59/0.75  % (30841)Time elapsed: 0.002 s
% 0.59/0.75  % (30841)Instructions burned: 3 (million)
% 0.59/0.75  % (30841)------------------------------
% 0.59/0.75  % (30841)------------------------------
% 0.59/0.76  % (30834)Refutation not found, incomplete strategy% (30834)------------------------------
% 0.59/0.76  % (30834)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (30838)Refutation not found, incomplete strategy% (30838)------------------------------
% 0.59/0.76  % (30838)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (30838)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.76  
% 0.59/0.76  % (30838)Memory used [KB]: 966
% 0.59/0.76  % (30838)Time elapsed: 0.003 s
% 0.59/0.76  % (30838)Instructions burned: 2 (million)
% 0.59/0.76  % (30834)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.76  
% 0.59/0.76  % (30834)Memory used [KB]: 966
% 0.59/0.76  % (30834)Time elapsed: 0.003 s
% 0.59/0.76  % (30834)Instructions burned: 2 (million)
% 0.59/0.76  % (30837)Refutation not found, incomplete strategy% (30837)------------------------------
% 0.59/0.76  % (30837)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (30840)First to succeed.
% 0.59/0.76  % (30837)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.76  
% 0.59/0.76  % (30837)Memory used [KB]: 966
% 0.59/0.76  % (30837)Time elapsed: 0.003 s
% 0.59/0.76  % (30837)Instructions burned: 3 (million)
% 0.59/0.76  % (30838)------------------------------
% 0.59/0.76  % (30838)------------------------------
% 0.59/0.76  % (30834)------------------------------
% 0.59/0.76  % (30834)------------------------------
% 0.59/0.76  % (30837)------------------------------
% 0.59/0.76  % (30837)------------------------------
% 0.59/0.76  % (30840)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30830"
% 0.59/0.76  % (30840)Refutation found. Thanks to Tanya!
% 0.59/0.76  % SZS status Theorem for Vampire---4
% 0.59/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76  % (30840)------------------------------
% 0.59/0.76  % (30840)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (30840)Termination reason: Refutation
% 0.59/0.76  
% 0.59/0.76  % (30840)Memory used [KB]: 964
% 0.59/0.76  % (30840)Time elapsed: 0.003 s
% 0.59/0.76  % (30840)Instructions burned: 3 (million)
% 0.59/0.76  % (30830)Success in time 0.384 s
% 0.59/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------