TSTP Solution File: SET693+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET693+4 : TPTP v8.1.2. Released v2.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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 : Wed May 1 03:48:38 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 67 ( 2 unt; 0 def)
% Number of atoms : 190 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 198 ( 75 ~; 87 |; 21 &)
% ( 11 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 62 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f87,plain,
$false,
inference(avatar_sat_refutation,[],[f47,f48,f59,f65,f73,f80,f86]) ).
fof(f86,plain,
( spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f85]) ).
fof(f85,plain,
( $false
| spl3_2
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f84,f75]) ).
fof(f75,plain,
( ~ member(sK2(sK1,sK0),sK0)
| spl3_2 ),
inference(resolution,[],[f46,f32]) ).
fof(f32,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f21,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xPKewJb2yi/Vampire---4.8_23259',subset) ).
fof(f46,plain,
( ~ subset(sK1,sK0)
| spl3_2 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f44,plain,
( spl3_2
<=> subset(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f84,plain,
( member(sK2(sK1,sK0),sK0)
| spl3_2
| ~ spl3_4 ),
inference(resolution,[],[f83,f74]) ).
fof(f74,plain,
( member(sK2(sK1,sK0),sK1)
| spl3_2 ),
inference(resolution,[],[f46,f31]) ).
fof(f31,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f83,plain,
( ! [X0] :
( ~ member(X0,sK1)
| member(X0,sK0) )
| ~ spl3_4 ),
inference(resolution,[],[f81,f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xPKewJb2yi/Vampire---4.8_23259',union) ).
fof(f81,plain,
( ! [X0] :
( ~ member(X0,union(sK0,sK1))
| member(X0,sK0) )
| ~ spl3_4 ),
inference(resolution,[],[f57,f30]) ).
fof(f30,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f57,plain,
( subset(union(sK0,sK1),sK0)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f56,plain,
( spl3_4
<=> subset(union(sK0,sK1),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f80,plain,
( spl3_4
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f77,f40,f56]) ).
fof(f40,plain,
( spl3_1
<=> equal_set(sK0,union(sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f77,plain,
( subset(union(sK0,sK1),sK0)
| ~ spl3_1 ),
inference(resolution,[],[f41,f37]) ).
fof(f37,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xPKewJb2yi/Vampire---4.8_23259',equal_set) ).
fof(f41,plain,
( equal_set(sK0,union(sK0,sK1))
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f73,plain,
( ~ spl3_2
| spl3_4 ),
inference(avatar_contradiction_clause,[],[f72]) ).
fof(f72,plain,
( $false
| ~ spl3_2
| spl3_4 ),
inference(subsumption_resolution,[],[f71,f68]) ).
fof(f68,plain,
( ~ member(sK2(union(sK0,sK1),sK0),sK0)
| spl3_4 ),
inference(resolution,[],[f58,f32]) ).
fof(f58,plain,
( ~ subset(union(sK0,sK1),sK0)
| spl3_4 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f71,plain,
( member(sK2(union(sK0,sK1),sK0),sK0)
| ~ spl3_2
| spl3_4 ),
inference(resolution,[],[f70,f49]) ).
fof(f49,plain,
( ! [X0] :
( ~ member(X0,sK1)
| member(X0,sK0) )
| ~ spl3_2 ),
inference(resolution,[],[f45,f30]) ).
fof(f45,plain,
( subset(sK1,sK0)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f70,plain,
( member(sK2(union(sK0,sK1),sK0),sK1)
| spl3_4 ),
inference(subsumption_resolution,[],[f69,f68]) ).
fof(f69,plain,
( member(sK2(union(sK0,sK1),sK0),sK0)
| member(sK2(union(sK0,sK1),sK0),sK1)
| spl3_4 ),
inference(resolution,[],[f67,f33]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f67,plain,
( member(sK2(union(sK0,sK1),sK0),union(sK0,sK1))
| spl3_4 ),
inference(resolution,[],[f58,f31]) ).
fof(f65,plain,
spl3_3,
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f64,plain,
( $false
| spl3_3 ),
inference(subsumption_resolution,[],[f62,f60]) ).
fof(f60,plain,
( member(sK2(sK0,union(sK0,sK1)),sK0)
| spl3_3 ),
inference(resolution,[],[f54,f31]) ).
fof(f54,plain,
( ~ subset(sK0,union(sK0,sK1))
| spl3_3 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f52,plain,
( spl3_3
<=> subset(sK0,union(sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f62,plain,
( ~ member(sK2(sK0,union(sK0,sK1)),sK0)
| spl3_3 ),
inference(resolution,[],[f61,f34]) ).
fof(f34,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f61,plain,
( ~ member(sK2(sK0,union(sK0,sK1)),union(sK0,sK1))
| spl3_3 ),
inference(resolution,[],[f54,f32]) ).
fof(f59,plain,
( ~ spl3_3
| ~ spl3_4
| spl3_1 ),
inference(avatar_split_clause,[],[f50,f40,f56,f52]) ).
fof(f50,plain,
( ~ subset(union(sK0,sK1),sK0)
| ~ subset(sK0,union(sK0,sK1))
| spl3_1 ),
inference(resolution,[],[f42,f38]) ).
fof(f38,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f42,plain,
( ~ equal_set(sK0,union(sK0,sK1))
| spl3_1 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f48,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f28,f44,f40]) ).
fof(f28,plain,
( subset(sK1,sK0)
| equal_set(sK0,union(sK0,sK1)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( ( ~ subset(sK1,sK0)
| ~ equal_set(sK0,union(sK0,sK1)) )
& ( subset(sK1,sK0)
| equal_set(sK0,union(sK0,sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f18]) ).
fof(f18,plain,
( ? [X0,X1] :
( ( ~ subset(X1,X0)
| ~ equal_set(X0,union(X0,X1)) )
& ( subset(X1,X0)
| equal_set(X0,union(X0,X1)) ) )
=> ( ( ~ subset(sK1,sK0)
| ~ equal_set(sK0,union(sK0,sK1)) )
& ( subset(sK1,sK0)
| equal_set(sK0,union(sK0,sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0,X1] :
( ( ~ subset(X1,X0)
| ~ equal_set(X0,union(X0,X1)) )
& ( subset(X1,X0)
| equal_set(X0,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
? [X0,X1] :
( equal_set(X0,union(X0,X1))
<~> subset(X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
( equal_set(X0,union(X0,X1))
<=> subset(X1,X0) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1] :
( equal_set(X0,union(X0,X1))
<=> subset(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.xPKewJb2yi/Vampire---4.8_23259',thI20) ).
fof(f47,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f29,f44,f40]) ).
fof(f29,plain,
( ~ subset(sK1,sK0)
| ~ equal_set(sK0,union(sK0,sK1)) ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET693+4 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.15 % 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.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 17:33:29 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.37 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.xPKewJb2yi/Vampire---4.8_23259
% 0.56/0.76 % (23439)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.56/0.76 % (23441)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.56/0.76 % (23439)Refutation not found, incomplete strategy% (23439)------------------------------
% 0.56/0.76 % (23439)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.76 % (23439)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.76
% 0.56/0.76 % (23439)Memory used [KB]: 978
% 0.56/0.76 % (23439)Time elapsed: 0.002 s
% 0.56/0.76 % (23439)Instructions burned: 2 (million)
% 0.56/0.76 % (23439)------------------------------
% 0.56/0.76 % (23439)------------------------------
% 0.56/0.76 % (23434)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.56/0.76 % (23436)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.56/0.76 % (23441)First to succeed.
% 0.56/0.76 % (23437)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.56/0.76 % (23435)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.56/0.76 % (23440)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.56/0.76 % (23438)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.56/0.76 % (23441)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for Vampire---4
% 0.56/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.77 % (23441)------------------------------
% 0.56/0.77 % (23441)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.77 % (23441)Termination reason: Refutation
% 0.56/0.77
% 0.56/0.77 % (23441)Memory used [KB]: 1000
% 0.56/0.77 % (23441)Time elapsed: 0.003 s
% 0.56/0.77 % (23441)Instructions burned: 4 (million)
% 0.56/0.77 % (23441)------------------------------
% 0.56/0.77 % (23441)------------------------------
% 0.56/0.77 % (23419)Success in time 0.386 s
% 0.56/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------