TSTP Solution File: SET985+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET985+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 : n005.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:16 EDT 2024
% Result : Theorem 0.54s 0.75s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 56 ( 10 unt; 0 def)
% Number of atoms : 150 ( 43 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 149 ( 55 ~; 62 |; 17 &)
% ( 8 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 52 ( 38 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f117,plain,
$false,
inference(avatar_sat_refutation,[],[f46,f63,f65,f79,f85,f91,f107,f116]) ).
fof(f116,plain,
( spl6_3
| spl6_8
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f110,f39,f98,f56]) ).
fof(f56,plain,
( spl6_3
<=> subset(sK3,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f98,plain,
( spl6_8
<=> empty_set = cartesian_product2(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).
fof(f39,plain,
( spl6_1
<=> subset(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f110,plain,
( empty_set = cartesian_product2(sK2,sK3)
| subset(sK3,sK5)
| ~ spl6_1 ),
inference(resolution,[],[f31,f41]) ).
fof(f41,plain,
( subset(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f31,plain,
! [X2,X3,X0,X1] :
( ~ subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
| empty_set = cartesian_product2(X0,X1)
| subset(X1,X3) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2,X3] :
( ( subset(X1,X3)
& subset(X0,X2) )
| empty_set = cartesian_product2(X0,X1)
| ~ subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2,X3] :
( ( subset(X1,X3)
& subset(X0,X2) )
| empty_set = cartesian_product2(X0,X1)
| ~ subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2,X3] :
( subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
=> ( ( subset(X1,X3)
& subset(X0,X2) )
| empty_set = cartesian_product2(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.bEfQS7LJeh/Vampire---4.8_9339',t138_zfmisc_1) ).
fof(f107,plain,
( spl6_6
| spl6_5
| ~ spl6_8 ),
inference(avatar_split_clause,[],[f106,f98,f72,f76]) ).
fof(f76,plain,
( spl6_6
<=> empty_set = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f72,plain,
( spl6_5
<=> empty_set = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f106,plain,
( empty_set = sK2
| empty_set = sK3
| ~ spl6_8 ),
inference(trivial_inequality_removal,[],[f105]) ).
fof(f105,plain,
( empty_set != empty_set
| empty_set = sK2
| empty_set = sK3
| ~ spl6_8 ),
inference(superposition,[],[f27,f100]) ).
fof(f100,plain,
( empty_set = cartesian_product2(sK2,sK3)
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f27,plain,
! [X0,X1] :
( empty_set != cartesian_product2(X0,X1)
| empty_set = X0
| empty_set = X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( empty_set = cartesian_product2(X0,X1)
| ( empty_set != X1
& empty_set != X0 ) )
& ( empty_set = X1
| empty_set = X0
| empty_set != cartesian_product2(X0,X1) ) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( empty_set = cartesian_product2(X0,X1)
| ( empty_set != X1
& empty_set != X0 ) )
& ( empty_set = X1
| empty_set = X0
| empty_set != cartesian_product2(X0,X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
<=> ( empty_set = X1
| empty_set = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.bEfQS7LJeh/Vampire---4.8_9339',t113_zfmisc_1) ).
fof(f91,plain,
~ spl6_6,
inference(avatar_contradiction_clause,[],[f90]) ).
fof(f90,plain,
( $false
| ~ spl6_6 ),
inference(resolution,[],[f88,f35]) ).
fof(f35,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/tmp/tmp.bEfQS7LJeh/Vampire---4.8_9339',t2_xboole_1) ).
fof(f88,plain,
( ~ subset(empty_set,sK5)
| ~ spl6_6 ),
inference(superposition,[],[f34,f78]) ).
fof(f78,plain,
( empty_set = sK3
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f34,plain,
~ subset(sK3,sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( ~ subset(sK3,sK5)
& ( subset(cartesian_product2(sK3,sK2),cartesian_product2(sK5,sK4))
| subset(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5)) )
& ~ empty(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f13,f21,f20]) ).
fof(f20,plain,
( ? [X0] :
( ? [X1,X2,X3] :
( ~ subset(X1,X3)
& ( subset(cartesian_product2(X1,X0),cartesian_product2(X3,X2))
| subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ) )
& ~ empty(X0) )
=> ( ? [X3,X2,X1] :
( ~ subset(X1,X3)
& ( subset(cartesian_product2(X1,sK2),cartesian_product2(X3,X2))
| subset(cartesian_product2(sK2,X1),cartesian_product2(X2,X3)) ) )
& ~ empty(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ? [X3,X2,X1] :
( ~ subset(X1,X3)
& ( subset(cartesian_product2(X1,sK2),cartesian_product2(X3,X2))
| subset(cartesian_product2(sK2,X1),cartesian_product2(X2,X3)) ) )
=> ( ~ subset(sK3,sK5)
& ( subset(cartesian_product2(sK3,sK2),cartesian_product2(sK5,sK4))
| subset(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0] :
( ? [X1,X2,X3] :
( ~ subset(X1,X3)
& ( subset(cartesian_product2(X1,X0),cartesian_product2(X3,X2))
| subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ) )
& ~ empty(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0] :
( ~ empty(X0)
=> ! [X1,X2,X3] :
( ( subset(cartesian_product2(X1,X0),cartesian_product2(X3,X2))
| subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) )
=> subset(X1,X3) ) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0] :
( ~ empty(X0)
=> ! [X1,X2,X3] :
( ( subset(cartesian_product2(X1,X0),cartesian_product2(X3,X2))
| subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) )
=> subset(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.bEfQS7LJeh/Vampire---4.8_9339',t139_zfmisc_1) ).
fof(f85,plain,
~ spl6_5,
inference(avatar_contradiction_clause,[],[f84]) ).
fof(f84,plain,
( $false
| ~ spl6_5 ),
inference(resolution,[],[f82,f23]) ).
fof(f23,plain,
empty(empty_set),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
empty(empty_set),
file('/export/starexec/sandbox/tmp/tmp.bEfQS7LJeh/Vampire---4.8_9339',fc1_xboole_0) ).
fof(f82,plain,
( ~ empty(empty_set)
| ~ spl6_5 ),
inference(superposition,[],[f32,f74]) ).
fof(f74,plain,
( empty_set = sK2
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f32,plain,
~ empty(sK2),
inference(cnf_transformation,[],[f22]) ).
fof(f79,plain,
( spl6_5
| spl6_6
| ~ spl6_4 ),
inference(avatar_split_clause,[],[f70,f60,f76,f72]) ).
fof(f60,plain,
( spl6_4
<=> empty_set = cartesian_product2(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f70,plain,
( empty_set = sK3
| empty_set = sK2
| ~ spl6_4 ),
inference(trivial_inequality_removal,[],[f69]) ).
fof(f69,plain,
( empty_set != empty_set
| empty_set = sK3
| empty_set = sK2
| ~ spl6_4 ),
inference(superposition,[],[f27,f62]) ).
fof(f62,plain,
( empty_set = cartesian_product2(sK3,sK2)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f65,plain,
~ spl6_3,
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f64,plain,
( $false
| ~ spl6_3 ),
inference(resolution,[],[f58,f34]) ).
fof(f58,plain,
( subset(sK3,sK5)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f63,plain,
( spl6_3
| spl6_4
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f49,f43,f60,f56]) ).
fof(f43,plain,
( spl6_2
<=> subset(cartesian_product2(sK3,sK2),cartesian_product2(sK5,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f49,plain,
( empty_set = cartesian_product2(sK3,sK2)
| subset(sK3,sK5)
| ~ spl6_2 ),
inference(resolution,[],[f30,f45]) ).
fof(f45,plain,
( subset(cartesian_product2(sK3,sK2),cartesian_product2(sK5,sK4))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f30,plain,
! [X2,X3,X0,X1] :
( ~ subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
| empty_set = cartesian_product2(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f12]) ).
fof(f46,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f33,f43,f39]) ).
fof(f33,plain,
( subset(cartesian_product2(sK3,sK2),cartesian_product2(sK5,sK4))
| subset(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5)) ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SET985+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/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 : n005.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 17:01:22 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.bEfQS7LJeh/Vampire---4.8_9339
% 0.54/0.75 % (9455)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.54/0.75 % (9455)Refutation not found, incomplete strategy% (9455)------------------------------
% 0.54/0.75 % (9455)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (9455)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (9455)Memory used [KB]: 952
% 0.54/0.75 % (9455)Time elapsed: 0.001 s
% 0.54/0.75 % (9455)Instructions burned: 2 (million)
% 0.54/0.75 % (9455)------------------------------
% 0.54/0.75 % (9455)------------------------------
% 0.54/0.75 % (9448)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.54/0.75 % (9450)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.54/0.75 % (9452)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.54/0.75 % (9449)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.54/0.75 % (9453)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.54/0.75 % (9454)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.54/0.75 % (9451)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.54/0.75 % (9453)Refutation not found, incomplete strategy% (9453)------------------------------
% 0.54/0.75 % (9453)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (9453)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (9453)Memory used [KB]: 952
% 0.54/0.75 % (9453)Time elapsed: 0.002 s
% 0.54/0.75 % (9453)Instructions burned: 2 (million)
% 0.54/0.75 % (9451)Refutation not found, incomplete strategy% (9451)------------------------------
% 0.54/0.75 % (9451)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (9451)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (9451)Memory used [KB]: 952
% 0.54/0.75 % (9451)Time elapsed: 0.003 s
% 0.54/0.75 % (9452)Refutation not found, incomplete strategy% (9452)------------------------------
% 0.54/0.75 % (9452)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (9452)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (9452)Memory used [KB]: 957
% 0.54/0.75 % (9452)Time elapsed: 0.003 s
% 0.54/0.75 % (9452)Instructions burned: 2 (million)
% 0.54/0.75 % (9451)Instructions burned: 2 (million)
% 0.54/0.75 % (9453)------------------------------
% 0.54/0.75 % (9453)------------------------------
% 0.54/0.75 % (9452)------------------------------
% 0.54/0.75 % (9452)------------------------------
% 0.54/0.75 % (9451)------------------------------
% 0.54/0.75 % (9451)------------------------------
% 0.54/0.75 % (9448)Refutation not found, incomplete strategy% (9448)------------------------------
% 0.54/0.75 % (9448)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (9448)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (9448)Memory used [KB]: 983
% 0.54/0.75 % (9448)Time elapsed: 0.003 s
% 0.54/0.75 % (9448)Instructions burned: 3 (million)
% 0.54/0.75 % (9456)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.54/0.75 % (9448)------------------------------
% 0.54/0.75 % (9448)------------------------------
% 0.54/0.75 % (9449)First to succeed.
% 0.54/0.75 % (9454)Also succeeded, but the first one will report.
% 0.54/0.75 % (9450)Also succeeded, but the first one will report.
% 0.54/0.75 % (9449)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-9447"
% 0.54/0.75 % (9449)Refutation found. Thanks to Tanya!
% 0.54/0.75 % SZS status Theorem for Vampire---4
% 0.54/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.75 % (9449)------------------------------
% 0.54/0.75 % (9449)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (9449)Termination reason: Refutation
% 0.54/0.75
% 0.54/0.75 % (9449)Memory used [KB]: 1069
% 0.54/0.75 % (9449)Time elapsed: 0.006 s
% 0.54/0.75 % (9449)Instructions burned: 6 (million)
% 0.54/0.75 % (9447)Success in time 0.38 s
% 0.54/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------