TSTP Solution File: SET240-6 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET240-6 : TPTP v8.1.2. Bugfixed v2.1.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n017.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:05:00 EDT 2024

% Result   : Unsatisfiable 0.58s 0.74s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   12 (  10 unt;   0 def)
%            Number of atoms       :   14 (   3 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
%            Number of variables   :   18 (  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f154,plain,
    $false,
    inference(subsumption_resolution,[],[f144,f134]) ).

fof(f134,plain,
    ! [X0,X1] : ~ member(ordered_pair(u,X0),cross_product(x,X1)),
    inference(unit_resulting_resolution,[],[f114,f14]) ).

fof(f14,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ member(ordered_pair(X2,X3),cross_product(X0,X1))
      | member(X2,X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.n3dsI5Z7Nq/Vampire---4.8_20399',cartesian_product1) ).

fof(f114,axiom,
    ~ member(u,x),
    file('/export/starexec/sandbox2/tmp/tmp.n3dsI5Z7Nq/Vampire---4.8_20399',prove_restriction_alternate_defn3_2) ).

fof(f144,plain,
    member(ordered_pair(u,v),cross_product(x,y)),
    inference(unit_resulting_resolution,[],[f129,f22]) ).

fof(f22,axiom,
    ! [X0,X1,X4] :
      ( ~ member(X4,intersection(X0,X1))
      | member(X4,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.n3dsI5Z7Nq/Vampire---4.8_20399',intersection2) ).

fof(f129,plain,
    member(ordered_pair(u,v),intersection(xr,cross_product(x,y))),
    inference(forward_demodulation,[],[f116,f119]) ).

fof(f119,plain,
    ! [X0,X1,X5] : intersection(X5,cross_product(X0,X1)) = intersection(cross_product(X0,X1),X5),
    inference(definition_unfolding,[],[f28,f29]) ).

fof(f29,axiom,
    ! [X0,X1,X5] : restrict(X5,X0,X1) = intersection(cross_product(X0,X1),X5),
    file('/export/starexec/sandbox2/tmp/tmp.n3dsI5Z7Nq/Vampire---4.8_20399',restriction2) ).

fof(f28,axiom,
    ! [X0,X1,X5] : intersection(X5,cross_product(X0,X1)) = restrict(X5,X0,X1),
    file('/export/starexec/sandbox2/tmp/tmp.n3dsI5Z7Nq/Vampire---4.8_20399',restriction1) ).

fof(f116,plain,
    member(ordered_pair(u,v),intersection(cross_product(x,y),xr)),
    inference(definition_unfolding,[],[f113,f29]) ).

fof(f113,axiom,
    member(ordered_pair(u,v),restrict(xr,x,y)),
    file('/export/starexec/sandbox2/tmp/tmp.n3dsI5Z7Nq/Vampire---4.8_20399',prove_restriction_alternate_defn3_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SET240-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n017.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 16:42:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.14/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.n3dsI5Z7Nq/Vampire---4.8_20399
% 0.58/0.74  % (20775)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.58/0.74  % (20769)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.58/0.74  % (20772)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.58/0.74  % (20771)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.58/0.74  % (20770)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.58/0.74  % (20774)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.58/0.74  % (20773)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.58/0.74  % (20775)First to succeed.
% 0.58/0.74  % (20775)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20613"
% 0.58/0.74  % (20769)Refutation not found, incomplete strategy% (20769)------------------------------
% 0.58/0.74  % (20769)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74  % (20769)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74  
% 0.58/0.74  % (20769)Memory used [KB]: 1091
% 0.58/0.74  % (20769)Time elapsed: 0.003 s
% 0.58/0.74  % (20769)Instructions burned: 3 (million)
% 0.58/0.74  % (20774)Also succeeded, but the first one will report.
% 0.58/0.74  % (20771)Also succeeded, but the first one will report.
% 0.58/0.74  % (20775)Refutation found. Thanks to Tanya!
% 0.58/0.74  % SZS status Unsatisfiable for Vampire---4
% 0.58/0.74  % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.74  % (20775)------------------------------
% 0.58/0.74  % (20775)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74  % (20775)Termination reason: Refutation
% 0.58/0.74  
% 0.58/0.74  % (20775)Memory used [KB]: 1156
% 0.58/0.74  % (20775)Time elapsed: 0.003 s
% 0.58/0.74  % (20775)Instructions burned: 6 (million)
% 0.58/0.74  % (20613)Success in time 0.384 s
% 0.58/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------