TSTP Solution File: SET700+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET700+4 : TPTP v8.2.0. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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 : Tue May 21 03:12:53 EDT 2024
% Result : Theorem 0.49s 0.72s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 2 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 100 ( 33 ~; 39 |; 11 &)
% ( 11 <=>; 4 =>; 0 <=; 2 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 45 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f311,plain,
$false,
inference(avatar_sat_refutation,[],[f41,f42,f243,f310]) ).
fof(f310,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f309]) ).
fof(f309,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f304,f249]) ).
fof(f249,plain,
( ~ member(sK3(intersection(sK0,difference(sK2,sK1)),sK1),sK0)
| ~ spl4_1
| spl4_2 ),
inference(unit_resulting_resolution,[],[f40,f246]) ).
fof(f246,plain,
( ! [X0] :
( ~ member(sK3(X0,sK1),sK0)
| subset(X0,sK1) )
| ~ spl4_1 ),
inference(resolution,[],[f244,f26]) ).
fof(f26,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,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/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f244,plain,
( ! [X0] :
( member(X0,sK1)
| ~ member(X0,sK0) )
| ~ spl4_1 ),
inference(resolution,[],[f35,f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
( subset(sK0,sK1)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl4_1
<=> subset(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f40,plain,
( ~ subset(intersection(sK0,difference(sK2,sK1)),sK1)
| spl4_2 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl4_2
<=> subset(intersection(sK0,difference(sK2,sK1)),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f304,plain,
( member(sK3(intersection(sK0,difference(sK2,sK1)),sK1),sK0)
| spl4_2 ),
inference(resolution,[],[f247,f27]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X2)
& member(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
fof(f247,plain,
( member(sK3(intersection(sK0,difference(sK2,sK1)),sK1),intersection(sK0,difference(sK2,sK1)))
| spl4_2 ),
inference(unit_resulting_resolution,[],[f40,f25]) ).
fof(f25,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f243,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f242]) ).
fof(f242,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f231,f56]) ).
fof(f56,plain,
( ~ member(sK3(sK0,sK1),intersection(sK0,difference(sK2,sK1)))
| spl4_1
| ~ spl4_2 ),
inference(unit_resulting_resolution,[],[f39,f46,f24]) ).
fof(f46,plain,
( ~ member(sK3(sK0,sK1),sK1)
| spl4_1 ),
inference(unit_resulting_resolution,[],[f36,f26]) ).
fof(f36,plain,
( ~ subset(sK0,sK1)
| spl4_1 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f39,plain,
( subset(intersection(sK0,difference(sK2,sK1)),sK1)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f231,plain,
( member(sK3(sK0,sK1),intersection(sK0,difference(sK2,sK1)))
| spl4_1 ),
inference(unit_resulting_resolution,[],[f45,f59,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f59,plain,
( member(sK3(sK0,sK1),difference(sK2,sK1))
| spl4_1 ),
inference(unit_resulting_resolution,[],[f46,f50,f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( member(X0,difference(X2,X1))
<=> ( ~ member(X0,X1)
& member(X0,X2) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0,X3] :
( member(X1,difference(X3,X0))
<=> ( ~ member(X1,X0)
& member(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference) ).
fof(f50,plain,
( member(sK3(sK0,sK1),sK2)
| spl4_1 ),
inference(unit_resulting_resolution,[],[f22,f45,f24]) ).
fof(f22,plain,
subset(sK0,sK2),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
<~> subset(intersection(X0,difference(X2,X1)),X1) )
& subset(X1,X2)
& subset(X0,X2) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
<~> subset(intersection(X0,difference(X2,X1)),X1) )
& subset(X1,X2)
& subset(X0,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X2) )
=> ( subset(X0,X1)
<=> subset(intersection(X0,difference(X2,X1)),X1) ) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X3] :
( ( subset(X1,X3)
& subset(X0,X3) )
=> ( subset(X0,X1)
<=> subset(intersection(X0,difference(X3,X1)),X1) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1,X3] :
( ( subset(X1,X3)
& subset(X0,X3) )
=> ( subset(X0,X1)
<=> subset(intersection(X0,difference(X3,X1)),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI34) ).
fof(f45,plain,
( member(sK3(sK0,sK1),sK0)
| spl4_1 ),
inference(unit_resulting_resolution,[],[f36,f25]) ).
fof(f42,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f20,f38,f34]) ).
fof(f20,plain,
( subset(intersection(sK0,difference(sK2,sK1)),sK1)
| subset(sK0,sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f41,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f21,f38,f34]) ).
fof(f21,plain,
( ~ subset(intersection(sK0,difference(sK2,sK1)),sK1)
| ~ subset(sK0,sK1) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET700+4 : TPTP v8.2.0. Released v2.2.0.
% 0.11/0.14 % 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.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 11:39:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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/benchmark/theBenchmark.p
% 0.49/0.72 % (17539)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 theBenchmark for (2996ds/83Mi)
% 0.49/0.72 % (17533)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 theBenchmark for (2996ds/34Mi)
% 0.49/0.72 % (17536)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.49/0.72 % (17534)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 theBenchmark for (2996ds/51Mi)
% 0.49/0.72 % (17537)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 theBenchmark for (2996ds/34Mi)
% 0.49/0.72 % (17538)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.49/0.72 % (17538)Refutation not found, incomplete strategy% (17538)------------------------------
% 0.49/0.72 % (17538)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.72 % (17538)Termination reason: Refutation not found, incomplete strategy
% 0.49/0.72
% 0.49/0.72 % (17538)Memory used [KB]: 971
% 0.49/0.72 % (17538)Time elapsed: 0.002 s
% 0.49/0.72 % (17538)Instructions burned: 2 (million)
% 0.49/0.72 % (17538)------------------------------
% 0.49/0.72 % (17538)------------------------------
% 0.49/0.72 % (17537)Refutation not found, incomplete strategy% (17537)------------------------------
% 0.49/0.72 % (17537)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.72 % (17537)Termination reason: Refutation not found, incomplete strategy
% 0.49/0.72
% 0.49/0.72 % (17537)Memory used [KB]: 1044
% 0.49/0.72 % (17537)Time elapsed: 0.003 s
% 0.49/0.72 % (17537)Instructions burned: 3 (million)
% 0.49/0.72 % (17540)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.49/0.72 % (17537)------------------------------
% 0.49/0.72 % (17537)------------------------------
% 0.49/0.72 % (17539)First to succeed.
% 0.49/0.72 % (17539)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-17532"
% 0.49/0.72 % (17539)Refutation found. Thanks to Tanya!
% 0.49/0.72 % SZS status Theorem for theBenchmark
% 0.49/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.49/0.72 % (17539)------------------------------
% 0.49/0.72 % (17539)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.72 % (17539)Termination reason: Refutation
% 0.49/0.72
% 0.49/0.72 % (17539)Memory used [KB]: 1122
% 0.49/0.72 % (17539)Time elapsed: 0.005 s
% 0.49/0.72 % (17539)Instructions burned: 12 (million)
% 0.49/0.72 % (17532)Success in time 0.366 s
% 0.49/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------